./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.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_loopvsstraightlinecode_50-1loop_file-42.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', '93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5'] 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_loopvsstraightlinecode_50-1loop_file-42.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 93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:42:23,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:42:24,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:42:24,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:42:24,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:42:24,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:42:24,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:42:24,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:42:24,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:42:24,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:42:24,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:42:24,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:42:24,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:42:24,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:42:24,082 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:42:24,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:42:24,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:42:24,082 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:42:24,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:42:24,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:42:24,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:42:24,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:42:24,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:42:24,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:42:24,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:42:24,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:42:24,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:42:24,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:42:24,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:42:24,084 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 -> 93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5 [2024-11-07 08:42:24,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:42:24,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:42:24,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:42:24,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:42:24,362 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:42:24,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i [2024-11-07 08:42:25,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:42:25,779 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:42:25,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i [2024-11-07 08:42:25,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8af3d17da/faeba9f2fe60473cb7c13040e30b4a48/FLAG04a577bde [2024-11-07 08:42:26,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8af3d17da/faeba9f2fe60473cb7c13040e30b4a48 [2024-11-07 08:42:26,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:42:26,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:42:26,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:42:26,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:42:26,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:42:26,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a8c027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26, skipping insertion in model container [2024-11-07 08:42:26,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:42:26,228 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_loopvsstraightlinecode_50-1loop_file-42.i[915,928] [2024-11-07 08:42:26,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:42:26,270 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:42:26,277 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_loopvsstraightlinecode_50-1loop_file-42.i[915,928] [2024-11-07 08:42:26,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:42:26,304 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:42:26,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26 WrapperNode [2024-11-07 08:42:26,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:42:26,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:42:26,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:42:26,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:42:26,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,341 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-07 08:42:26,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:42:26,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:42:26,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:42:26,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:42:26,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,371 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 08:42:26,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:42:26,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:42:26,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:42:26,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:42:26,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (1/1) ... [2024-11-07 08:42:26,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:42:26,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:42:26,416 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 08:42:26,422 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 08:42:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:42:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:42:26,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:42:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:42:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:42:26,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:42:26,503 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:42:26,505 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:42:26,780 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-07 08:42:26,780 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:42:26,788 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:42:26,789 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:42:26,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:42:26 BoogieIcfgContainer [2024-11-07 08:42:26,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:42:26,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:42:26,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:42:26,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:42:26,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:42:26" (1/3) ... [2024-11-07 08:42:26,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355ede18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:42:26, skipping insertion in model container [2024-11-07 08:42:26,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:26" (2/3) ... [2024-11-07 08:42:26,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355ede18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:42:26, skipping insertion in model container [2024-11-07 08:42:26,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:42:26" (3/3) ... [2024-11-07 08:42:26,797 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-42.i [2024-11-07 08:42:26,806 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:42:26,807 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:42:26,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:42:26,867 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;@5342337f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:42:26,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:42:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:42:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 08:42:26,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:26,876 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:26,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:26,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:26,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2007489892, now seen corresponding path program 1 times [2024-11-07 08:42:26,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:42:26,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169121443] [2024-11-07 08:42:26,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:26,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:42:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:42:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:42:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:42:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:42:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:42:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:42:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:42:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:42:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:42:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:42:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:42:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:42:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:42:27,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:42:27,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169121443] [2024-11-07 08:42:27,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169121443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:42:27,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:42:27,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:42:27,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079063400] [2024-11-07 08:42:27,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:42:27,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:42:27,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:42:27,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:42:27,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:42:27,078 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:42:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:27,093 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2024-11-07 08:42:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:42:27,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2024-11-07 08:42:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:27,097 INFO L225 Difference]: With dead ends: 105 [2024-11-07 08:42:27,098 INFO L226 Difference]: Without dead ends: 50 [2024-11-07 08:42:27,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:42:27,101 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:27,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:42:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-07 08:42:27,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-07 08:42:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:42:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-11-07 08:42:27,124 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 87 [2024-11-07 08:42:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:27,125 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-11-07 08:42:27,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:42:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-11-07 08:42:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 08:42:27,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:27,129 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:27,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:42:27,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:27,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash 910056408, now seen corresponding path program 1 times [2024-11-07 08:42:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:42:27,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334607223] [2024-11-07 08:42:27,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:27,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:42:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:42:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:42:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:42:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:42:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:42:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:42:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:42:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:42:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:42:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:42:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:42:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:42:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:42:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:42:27,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334607223] [2024-11-07 08:42:27,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334607223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:42:27,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:42:27,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:42:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30094937] [2024-11-07 08:42:27,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:42:27,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:42:27,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:42:27,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:42:27,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:42:27,520 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:27,608 INFO L93 Difference]: Finished difference Result 145 states and 211 transitions. [2024-11-07 08:42:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:42:27,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-11-07 08:42:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:27,610 INFO L225 Difference]: With dead ends: 145 [2024-11-07 08:42:27,610 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 08:42:27,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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 08:42:27,611 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 71 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:27,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 198 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:42:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 08:42:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2024-11-07 08:42:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 08:42:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2024-11-07 08:42:27,622 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 87 [2024-11-07 08:42:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:27,623 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2024-11-07 08:42:27,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2024-11-07 08:42:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:42:27,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:27,624 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:27,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:42:27,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:27,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2079259996, now seen corresponding path program 1 times [2024-11-07 08:42:27,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:42:27,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739726455] [2024-11-07 08:42:27,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:27,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:42:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:42:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:42:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:42:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:42:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:42:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:42:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:42:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:42:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:42:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:42:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:42:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:42:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:42:28,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:42:28,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739726455] [2024-11-07 08:42:28,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739726455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:42:28,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:42:28,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:42:28,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44946118] [2024-11-07 08:42:28,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:42:28,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:42:28,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:42:28,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:42:28,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:42:28,014 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:28,285 INFO L93 Difference]: Finished difference Result 215 states and 315 transitions. [2024-11-07 08:42:28,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:42:28,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-07 08:42:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:28,288 INFO L225 Difference]: With dead ends: 215 [2024-11-07 08:42:28,288 INFO L226 Difference]: Without dead ends: 168 [2024-11-07 08:42:28,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:42:28,289 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 102 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:28,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 300 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:42:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-07 08:42:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 121. [2024-11-07 08:42:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 08:42:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2024-11-07 08:42:28,309 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 88 [2024-11-07 08:42:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:28,310 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2024-11-07 08:42:28,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2024-11-07 08:42:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:42:28,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:28,311 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:28,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:42:28,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:28,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:28,312 INFO L85 PathProgramCache]: Analyzing trace with hash 935843622, now seen corresponding path program 1 times [2024-11-07 08:42:28,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:42:28,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336375485] [2024-11-07 08:42:28,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:28,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:42:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:42:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:42:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:42:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:42:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:42:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:42:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:42:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:42:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:42:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:42:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:42:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:42:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:42:28,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:42:28,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336375485] [2024-11-07 08:42:28,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336375485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:42:28,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:42:28,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:42:28,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969215360] [2024-11-07 08:42:28,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:42:28,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:42:28,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:42:28,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:42:28,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:42:28,449 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:28,479 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2024-11-07 08:42:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:42:28,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-07 08:42:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:28,481 INFO L225 Difference]: With dead ends: 213 [2024-11-07 08:42:28,481 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 08:42:28,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:42:28,482 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:28,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:42:28,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 08:42:28,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-07 08:42:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 81 states have internal predecessors, (102), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 08:42:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2024-11-07 08:42:28,495 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 88 [2024-11-07 08:42:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:28,496 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2024-11-07 08:42:28,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2024-11-07 08:42:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:42:28,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:28,496 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:28,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:42:28,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:28,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:28,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1615901992, now seen corresponding path program 1 times [2024-11-07 08:42:28,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:42:28,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458712808] [2024-11-07 08:42:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:28,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:42:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:42:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:42:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:42:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:42:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:42:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:42:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:42:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:42:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:42:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:42:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:42:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:42:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-07 08:42:28,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:42:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458712808] [2024-11-07 08:42:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458712808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:42:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108053744] [2024-11-07 08:42:28,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:28,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:42:28,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:42:29,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:42:29,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:42:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:29,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 08:42:29,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:42:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-07 08:42:29,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:42:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-07 08:42:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108053744] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:42:29,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:42:29,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-07 08:42:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732873942] [2024-11-07 08:42:29,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:42:29,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 08:42:29,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:42:29,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 08:42:29,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:42:29,626 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 08:42:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:30,309 INFO L93 Difference]: Finished difference Result 388 states and 517 transitions. [2024-11-07 08:42:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-07 08:42:30,309 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 88 [2024-11-07 08:42:30,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:30,315 INFO L225 Difference]: With dead ends: 388 [2024-11-07 08:42:30,316 INFO L226 Difference]: Without dead ends: 341 [2024-11-07 08:42:30,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=482, Invalid=1410, Unknown=0, NotChecked=0, Total=1892 [2024-11-07 08:42:30,317 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 195 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:30,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 377 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:42:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-07 08:42:30,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 207. [2024-11-07 08:42:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.2328767123287672) internal successors, (180), 146 states have internal predecessors, (180), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:42:30,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 276 transitions. [2024-11-07 08:42:30,350 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 276 transitions. Word has length 88 [2024-11-07 08:42:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:30,350 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 276 transitions. [2024-11-07 08:42:30,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 08:42:30,350 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 276 transitions. [2024-11-07 08:42:30,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:42:30,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:30,351 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:30,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:42:30,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:42:30,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:30,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:30,557 INFO L85 PathProgramCache]: Analyzing trace with hash 604784742, now seen corresponding path program 1 times [2024-11-07 08:42:30,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:42:30,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60004233] [2024-11-07 08:42:30,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:30,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:42:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:42:30,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [553425690] [2024-11-07 08:42:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:30,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:42:30,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:42:30,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:42:30,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 08:42:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:30,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 08:42:30,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:42:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 110 proven. 57 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-07 08:42:31,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:42:31,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:42:31,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60004233] [2024-11-07 08:42:31,625 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 08:42:31,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553425690] [2024-11-07 08:42:31,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553425690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:42:31,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:42:31,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-07 08:42:31,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502438163] [2024-11-07 08:42:31,625 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 08:42:31,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 08:42:31,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:42:31,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 08:42:31,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=289, Unknown=6, NotChecked=0, Total=420 [2024-11-07 08:42:31,626 INFO L87 Difference]: Start difference. First operand 207 states and 276 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 08:42:32,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:32,269 INFO L93 Difference]: Finished difference Result 649 states and 834 transitions. [2024-11-07 08:42:32,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 08:42:32,270 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 88 [2024-11-07 08:42:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:32,274 INFO L225 Difference]: With dead ends: 649 [2024-11-07 08:42:32,274 INFO L226 Difference]: Without dead ends: 542 [2024-11-07 08:42:32,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=356, Invalid=828, Unknown=6, NotChecked=0, Total=1190 [2024-11-07 08:42:32,278 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 155 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:32,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 670 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:42:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-07 08:42:32,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 448. [2024-11-07 08:42:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 328 states have (on average 1.225609756097561) internal successors, (402), 330 states have internal predecessors, (402), 88 states have call successors, (88), 31 states have call predecessors, (88), 31 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-07 08:42:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 578 transitions. [2024-11-07 08:42:32,384 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 578 transitions. Word has length 88 [2024-11-07 08:42:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:32,389 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 578 transitions. [2024-11-07 08:42:32,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 08:42:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 578 transitions. [2024-11-07 08:42:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:42:32,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:32,390 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:32,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 08:42:32,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:42:32,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:32,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:32,592 INFO L85 PathProgramCache]: Analyzing trace with hash 17978728, now seen corresponding path program 1 times [2024-11-07 08:42:32,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:42:32,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564956767] [2024-11-07 08:42:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:32,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:42:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:42:32,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100654302] [2024-11-07 08:42:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:32,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:42:32,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:42:32,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:42:32,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 08:42:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:32,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 08:42:32,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:42:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-07 08:42:33,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:42:33,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:42:33,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564956767] [2024-11-07 08:42:33,623 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 08:42:33,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100654302] [2024-11-07 08:42:33,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100654302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:42:33,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:42:33,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-07 08:42:33,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797979879] [2024-11-07 08:42:33,623 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 08:42:33,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 08:42:33,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:42:33,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 08:42:33,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-11-07 08:42:33,624 INFO L87 Difference]: Start difference. First operand 448 states and 578 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:42:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:34,208 INFO L93 Difference]: Finished difference Result 874 states and 1139 transitions. [2024-11-07 08:42:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 08:42:34,208 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2024-11-07 08:42:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:34,213 INFO L225 Difference]: With dead ends: 874 [2024-11-07 08:42:34,214 INFO L226 Difference]: Without dead ends: 710 [2024-11-07 08:42:34,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-11-07 08:42:34,215 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 96 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 34 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:34,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 576 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 452 Invalid, 6 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:42:34,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-07 08:42:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 569. [2024-11-07 08:42:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 415 states have (on average 1.216867469879518) internal successors, (505), 417 states have internal predecessors, (505), 112 states have call successors, (112), 41 states have call predecessors, (112), 41 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-07 08:42:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 729 transitions. [2024-11-07 08:42:34,281 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 729 transitions. Word has length 88 [2024-11-07 08:42:34,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:34,281 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 729 transitions. [2024-11-07 08:42:34,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:42:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 729 transitions. [2024-11-07 08:42:34,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 08:42:34,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:34,286 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:34,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 08:42:34,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:42:34,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:34,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash -115829519, now seen corresponding path program 1 times [2024-11-07 08:42:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:42:34,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895592792] [2024-11-07 08:42:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:42:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:42:34,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1835180172] [2024-11-07 08:42:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:34,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:42:34,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:42:34,553 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:42:34,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 08:42:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:42:34,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:42:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:42:34,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:42:34,783 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:42:34,784 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:42:34,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 08:42:34,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-07 08:42:34,988 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:42:35,057 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:42:35,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:42:35 BoogieIcfgContainer [2024-11-07 08:42:35,063 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:42:35,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:42:35,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:42:35,064 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:42:35,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:42:26" (3/4) ... [2024-11-07 08:42:35,068 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:42:35,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:42:35,069 INFO L158 Benchmark]: Toolchain (without parser) took 8937.52ms. Allocated memory was 109.1MB in the beginning and 218.1MB in the end (delta: 109.1MB). Free memory was 85.4MB in the beginning and 103.7MB in the end (delta: -18.3MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2024-11-07 08:42:35,070 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:42:35,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.87ms. Allocated memory is still 109.1MB. Free memory was 85.2MB in the beginning and 71.5MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:42:35,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.22ms. Allocated memory is still 109.1MB. Free memory was 71.5MB in the beginning and 68.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:42:35,071 INFO L158 Benchmark]: Boogie Preprocessor took 39.52ms. Allocated memory is still 109.1MB. Free memory was 68.2MB in the beginning and 63.4MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:42:35,071 INFO L158 Benchmark]: RCFGBuilder took 406.39ms. Allocated memory is still 109.1MB. Free memory was 63.4MB in the beginning and 43.9MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:42:35,071 INFO L158 Benchmark]: TraceAbstraction took 8272.45ms. Allocated memory was 109.1MB in the beginning and 218.1MB in the end (delta: 109.1MB). Free memory was 43.3MB in the beginning and 103.8MB in the end (delta: -60.5MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2024-11-07 08:42:35,072 INFO L158 Benchmark]: Witness Printer took 4.81ms. Allocated memory is still 218.1MB. Free memory was 103.8MB in the beginning and 103.7MB in the end (delta: 34.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:42:35,073 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.67ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.87ms. Allocated memory is still 109.1MB. Free memory was 85.2MB in the beginning and 71.5MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.22ms. Allocated memory is still 109.1MB. Free memory was 71.5MB in the beginning and 68.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.52ms. Allocated memory is still 109.1MB. Free memory was 68.2MB in the beginning and 63.4MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 406.39ms. Allocated memory is still 109.1MB. Free memory was 63.4MB in the beginning and 43.9MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8272.45ms. Allocated memory was 109.1MB in the beginning and 218.1MB in the end (delta: 109.1MB). Free memory was 43.3MB in the beginning and 103.8MB in the end (delta: -60.5MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. * Witness Printer took 4.81ms. Allocated memory is still 218.1MB. Free memory was 103.8MB in the beginning and 103.7MB in the end (delta: 34.3kB). 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] signed short int last_1_var_1_1 = 16; [L37] unsigned char last_1_var_1_6 = 10; [L38] unsigned char last_1_var_1_8 = 1; [L39] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L127] isInitial = 1 [L128] FCALL initially() [L129] int k_loop; [L130] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L130] COND TRUE k_loop < 1 [L131] CALL updateLastVariables() [L117] last_1_var_1_1 = var_1_1 [L118] last_1_var_1_6 = var_1_6 [L119] last_1_var_1_8 = var_1_8 [L120] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L131] RET updateLastVariables() [L132] CALL updateVariables() [L96] var_1_5 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L97] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L98] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L98] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L100] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L101] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L101] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L104] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L104] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L105] var_1_12 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L106] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L107] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L107] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L108] var_1_15 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L109] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L110] var_1_16 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L111] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L112] var_1_20 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L114] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L114] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L132] RET updateVariables() [L133] CALL step() [L43] signed long int stepLocal_6 = last_1_var_1_1; [L44] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L45] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L46] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L49] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L54] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L57] COND TRUE var_1_5 >= -2 [L58] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L60] unsigned char stepLocal_4 = var_1_6; [L61] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L62] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L63] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L64] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L71] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L72] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L75] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L76] COND TRUE \read(var_1_19) [L77] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L83] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L84] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-2, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L85] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L92] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-2, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L133] RET step() [L134] CALL, EXPR property() [L123-L124] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 8, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 633 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 619 mSDsluCounter, 2325 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1732 mSDsCounter, 228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1404 IncrementalHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 228 mSolverCounterUnsat, 593 mSDtfsCounter, 1404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 702 GetRequests, 591 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=569occurred in iteration=7, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 438 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1056 NumberOfCodeBlocks, 1056 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 781 ConstructedInterpolants, 1 QuantifiedInterpolants, 3597 SizeOfPredicates, 18 NumberOfNonLiveVariables, 699 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 2262/2376 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 08:42:35,121 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_loopvsstraightlinecode_50-1loop_file-42.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:42:37,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:42:37,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:42:37,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:42:37,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:42:37,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:42:37,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:42:37,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:42:37,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:42:37,297 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:42:37,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:42:37,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:42:37,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:42:37,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:42:37,298 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:42:37,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:42:37,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:42:37,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:42:37,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:42:37,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:42:37,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:42:37,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:42:37,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:42:37,298 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:42:37,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:42:37,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:42:37,299 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:42:37,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:42:37,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:42:37,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:42:37,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:42:37,303 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 -> 93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5 [2024-11-07 08:42:37,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:42:37,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:42:37,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:42:37,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:42:37,549 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:42:37,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i [2024-11-07 08:42:38,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:42:38,975 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:42:38,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i [2024-11-07 08:42:38,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1f4ea82d/07b834acfe0c45479dadafaddb4d87f3/FLAG1228f11d0 [2024-11-07 08:42:38,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1f4ea82d/07b834acfe0c45479dadafaddb4d87f3 [2024-11-07 08:42:38,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:42:38,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:42:38,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:42:38,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:42:38,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:42:38,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:42:38" (1/1) ... [2024-11-07 08:42:39,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18581874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39, skipping insertion in model container [2024-11-07 08:42:39,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:42:38" (1/1) ... [2024-11-07 08:42:39,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:42:39,113 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_loopvsstraightlinecode_50-1loop_file-42.i[915,928] [2024-11-07 08:42:39,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:42:39,180 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:42:39,188 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_loopvsstraightlinecode_50-1loop_file-42.i[915,928] [2024-11-07 08:42:39,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:42:39,241 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:42:39,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39 WrapperNode [2024-11-07 08:42:39,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:42:39,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:42:39,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:42:39,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:42:39,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (1/1) ... [2024-11-07 08:42:39,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (1/1) ... [2024-11-07 08:42:39,290 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-07 08:42:39,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:42:39,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:42:39,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:42:39,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:42:39,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (1/1) ... [2024-11-07 08:42:39,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (1/1) ... [2024-11-07 08:42:39,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (1/1) ... [2024-11-07 08:42:39,317 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 08:42:39,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (1/1) ... [2024-11-07 08:42:39,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (1/1) ... [2024-11-07 08:42:39,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (1/1) ... [2024-11-07 08:42:39,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (1/1) ... [2024-11-07 08:42:39,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (1/1) ... [2024-11-07 08:42:39,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (1/1) ... [2024-11-07 08:42:39,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:42:39,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:42:39,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:42:39,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:42:39,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (1/1) ... [2024-11-07 08:42:39,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:42:39,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:42:39,375 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 08:42:39,377 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 08:42:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:42:39,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:42:39,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:42:39,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:42:39,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:42:39,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:42:39,447 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:42:39,448 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:42:39,713 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-07 08:42:39,714 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:42:39,721 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:42:39,721 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:42:39,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:42:39 BoogieIcfgContainer [2024-11-07 08:42:39,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:42:39,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:42:39,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:42:39,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:42:39,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:42:38" (1/3) ... [2024-11-07 08:42:39,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ba751e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:42:39, skipping insertion in model container [2024-11-07 08:42:39,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:39" (2/3) ... [2024-11-07 08:42:39,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ba751e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:42:39, skipping insertion in model container [2024-11-07 08:42:39,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:42:39" (3/3) ... [2024-11-07 08:42:39,732 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-42.i [2024-11-07 08:42:39,744 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:42:39,744 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:42:39,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:42:39,788 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;@16442562, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:42:39,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:42:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:42:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 08:42:39,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:39,797 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:39,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:39,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:39,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2007489892, now seen corresponding path program 1 times [2024-11-07 08:42:39,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:42:39,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131395253] [2024-11-07 08:42:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:39,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:39,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:42:39,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:42:39,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 08:42:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:40,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:42:40,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:42:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-07 08:42:40,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:42:40,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:42:40,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131395253] [2024-11-07 08:42:40,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131395253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:42:40,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:42:40,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:42:40,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252981900] [2024-11-07 08:42:40,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:42:40,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:42:40,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:42:40,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:42:40,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:42:40,099 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:42:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:40,118 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2024-11-07 08:42:40,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:42:40,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2024-11-07 08:42:40,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:40,123 INFO L225 Difference]: With dead ends: 105 [2024-11-07 08:42:40,124 INFO L226 Difference]: Without dead ends: 50 [2024-11-07 08:42:40,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:42:40,130 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:40,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:42:40,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-07 08:42:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-07 08:42:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:42:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-11-07 08:42:40,163 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 87 [2024-11-07 08:42:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:40,164 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-11-07 08:42:40,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:42:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-11-07 08:42:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 08:42:40,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:40,166 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:40,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 08:42:40,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:40,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:40,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:40,372 INFO L85 PathProgramCache]: Analyzing trace with hash 910056408, now seen corresponding path program 1 times [2024-11-07 08:42:40,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:42:40,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433897537] [2024-11-07 08:42:40,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:40,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:40,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:42:40,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:42:40,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:42:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:40,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 08:42:40,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:42:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:42:40,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:42:40,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:42:40,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433897537] [2024-11-07 08:42:40,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433897537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:42:40,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:42:40,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:42:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132567265] [2024-11-07 08:42:40,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:42:40,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:42:40,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:42:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:42:40,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:42:40,803 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:41,088 INFO L93 Difference]: Finished difference Result 145 states and 211 transitions. [2024-11-07 08:42:41,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:42:41,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-11-07 08:42:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:41,097 INFO L225 Difference]: With dead ends: 145 [2024-11-07 08:42:41,097 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 08:42:41,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 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 08:42:41,098 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 68 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:41,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 198 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:42:41,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 08:42:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2024-11-07 08:42:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 08:42:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2024-11-07 08:42:41,118 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 87 [2024-11-07 08:42:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:41,119 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2024-11-07 08:42:41,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2024-11-07 08:42:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:42:41,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:41,123 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:41,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:42:41,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:41,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:41,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:41,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2079259996, now seen corresponding path program 1 times [2024-11-07 08:42:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:42:41,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285383221] [2024-11-07 08:42:41,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:41,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:41,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:42:41,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:42:41,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:42:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:41,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 08:42:41,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:42:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:42:41,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:42:41,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:42:41,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285383221] [2024-11-07 08:42:41,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285383221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:42:41,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:42:41,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:42:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397955481] [2024-11-07 08:42:41,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:42:41,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:42:41,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:42:41,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:42:41,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:42:41,834 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:42,471 INFO L93 Difference]: Finished difference Result 215 states and 315 transitions. [2024-11-07 08:42:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:42:42,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-07 08:42:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:42,482 INFO L225 Difference]: With dead ends: 215 [2024-11-07 08:42:42,483 INFO L226 Difference]: Without dead ends: 168 [2024-11-07 08:42:42,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:42:42,487 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 99 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:42,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 300 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 08:42:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-07 08:42:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 121. [2024-11-07 08:42:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 08:42:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2024-11-07 08:42:42,504 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 88 [2024-11-07 08:42:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:42,504 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2024-11-07 08:42:42,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2024-11-07 08:42:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:42:42,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:42,505 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:42,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 08:42:42,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:42,710 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:42,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash 935843622, now seen corresponding path program 1 times [2024-11-07 08:42:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:42:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155979087] [2024-11-07 08:42:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:42,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:42,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:42:42,715 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:42:42,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 08:42:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:42,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 08:42:42,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:42:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:42:42,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:42:42,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:42:42,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155979087] [2024-11-07 08:42:42,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155979087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:42:42,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:42:42,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:42:42,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726649932] [2024-11-07 08:42:42,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:42:42,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:42:42,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:42:42,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:42:42,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:42:42,880 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:43,068 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2024-11-07 08:42:43,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:42:43,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-07 08:42:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:43,077 INFO L225 Difference]: With dead ends: 213 [2024-11-07 08:42:43,077 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 08:42:43,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:42:43,078 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:43,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:42:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 08:42:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-07 08:42:43,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 81 states have internal predecessors, (102), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 08:42:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2024-11-07 08:42:43,100 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 88 [2024-11-07 08:42:43,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:43,101 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2024-11-07 08:42:43,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2024-11-07 08:42:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:42:43,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:43,101 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:43,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 08:42:43,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:43,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:43,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:43,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1615901992, now seen corresponding path program 1 times [2024-11-07 08:42:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:42:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458127773] [2024-11-07 08:42:43,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:43,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:43,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:42:43,308 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:42:43,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 08:42:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:43,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 08:42:43,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:42:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-07 08:42:43,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:42:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-07 08:42:43,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:42:43,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458127773] [2024-11-07 08:42:43,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458127773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:42:43,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:42:43,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-07 08:42:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934755080] [2024-11-07 08:42:43,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:42:43,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 08:42:43,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:42:43,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 08:42:43,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:42:43,766 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 08:42:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:44,749 INFO L93 Difference]: Finished difference Result 280 states and 371 transitions. [2024-11-07 08:42:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 08:42:44,750 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 88 [2024-11-07 08:42:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:44,755 INFO L225 Difference]: With dead ends: 280 [2024-11-07 08:42:44,755 INFO L226 Difference]: Without dead ends: 233 [2024-11-07 08:42:44,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 08:42:44,756 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 251 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:44,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 321 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 08:42:44,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-07 08:42:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 207. [2024-11-07 08:42:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.2328767123287672) internal successors, (180), 146 states have internal predecessors, (180), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:42:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 276 transitions. [2024-11-07 08:42:44,784 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 276 transitions. Word has length 88 [2024-11-07 08:42:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:44,785 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 276 transitions. [2024-11-07 08:42:44,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 08:42:44,785 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 276 transitions. [2024-11-07 08:42:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:42:44,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:44,786 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:44,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 08:42:44,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:44,990 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:44,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:44,990 INFO L85 PathProgramCache]: Analyzing trace with hash 604784742, now seen corresponding path program 1 times [2024-11-07 08:42:44,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:42:44,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084552912] [2024-11-07 08:42:44,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:44,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:44,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:42:44,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:42:44,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 08:42:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:45,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 08:42:45,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:42:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-07 08:42:45,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:42:46,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:42:46,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084552912] [2024-11-07 08:42:46,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084552912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:42:46,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1223041984] [2024-11-07 08:42:46,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:46,034 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 08:42:46,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 08:42:46,036 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 08:42:46,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-07 08:42:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:46,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 08:42:46,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:42:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:42:46,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:42:46,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1223041984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:42:46,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:42:46,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-07 08:42:46,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998055773] [2024-11-07 08:42:46,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:42:46,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:42:46,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:42:46,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:42:46,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:42:46,755 INFO L87 Difference]: Start difference. First operand 207 states and 276 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:48,421 INFO L93 Difference]: Finished difference Result 601 states and 794 transitions. [2024-11-07 08:42:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 08:42:48,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-07 08:42:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:48,430 INFO L225 Difference]: With dead ends: 601 [2024-11-07 08:42:48,430 INFO L226 Difference]: Without dead ends: 494 [2024-11-07 08:42:48,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:42:48,431 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 122 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:48,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 345 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 08:42:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-07 08:42:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 416. [2024-11-07 08:42:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 304 states have (on average 1.243421052631579) internal successors, (378), 306 states have internal predecessors, (378), 88 states have call successors, (88), 23 states have call predecessors, (88), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-07 08:42:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 554 transitions. [2024-11-07 08:42:48,461 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 554 transitions. Word has length 88 [2024-11-07 08:42:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:48,461 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 554 transitions. [2024-11-07 08:42:48,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:48,461 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 554 transitions. [2024-11-07 08:42:48,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 08:42:48,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:48,462 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:48,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 08:42:48,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-07 08:42:48,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 08:42:48,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:48,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:48,863 INFO L85 PathProgramCache]: Analyzing trace with hash 17978728, now seen corresponding path program 1 times [2024-11-07 08:42:48,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:42:48,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084896446] [2024-11-07 08:42:48,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:48,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:48,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:42:48,866 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:42:48,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 08:42:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:49,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 08:42:49,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:42:49,393 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-07 08:42:49,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:42:49,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:42:49,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084896446] [2024-11-07 08:42:49,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084896446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:42:49,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1407151281] [2024-11-07 08:42:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:49,674 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 08:42:49,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 08:42:49,676 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 08:42:49,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-07 08:42:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:49,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 08:42:49,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:42:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:42:50,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:42:50,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1407151281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:42:50,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:42:50,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-07 08:42:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412857422] [2024-11-07 08:42:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:42:50,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:42:50,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:42:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:42:50,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:42:50,478 INFO L87 Difference]: Start difference. First operand 416 states and 554 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:42:51,519 INFO L93 Difference]: Finished difference Result 730 states and 972 transitions. [2024-11-07 08:42:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:42:51,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-07 08:42:51,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:42:51,523 INFO L225 Difference]: With dead ends: 730 [2024-11-07 08:42:51,523 INFO L226 Difference]: Without dead ends: 566 [2024-11-07 08:42:51,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:42:51,527 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 68 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 08:42:51,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 287 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 08:42:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-07 08:42:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 521. [2024-11-07 08:42:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 379 states have (on average 1.237467018469657) internal successors, (469), 381 states have internal predecessors, (469), 112 states have call successors, (112), 29 states have call predecessors, (112), 29 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-07 08:42:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 693 transitions. [2024-11-07 08:42:51,577 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 693 transitions. Word has length 88 [2024-11-07 08:42:51,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:42:51,577 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 693 transitions. [2024-11-07 08:42:51,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:42:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 693 transitions. [2024-11-07 08:42:51,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 08:42:51,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:42:51,578 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:42:51,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 08:42:51,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-07 08:42:51,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 08:42:51,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:42:51,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:42:51,980 INFO L85 PathProgramCache]: Analyzing trace with hash -115829519, now seen corresponding path program 1 times [2024-11-07 08:42:51,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:42:51,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004240769] [2024-11-07 08:42:51,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:42:51,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:42:51,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:42:51,984 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:42:51,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 08:42:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:42:52,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 08:42:52,110 INFO L278 TraceCheckSpWp]: Computing forward predicates...