./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-31.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_floatingpointinfluence_no-floats_file-31.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', '150a4f89afb8d47829e7ddadced75f5718c6f777677ea3eeca89c33b976a5a9c'] 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_floatingpointinfluence_no-floats_file-31.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 150a4f89afb8d47829e7ddadced75f5718c6f777677ea3eeca89c33b976a5a9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:46:56,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:46:56,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:46:56,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:46:56,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:46:56,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:46:56,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:46:56,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:46:56,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:46:56,755 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:46:56,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:46:56,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:46:56,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:46:56,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:46:56,757 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:46:56,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:46:56,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:46:56,758 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:46:56,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:46:56,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:46:56,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:46:56,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:46:56,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:46:56,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:46:56,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:46:56,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:46:56,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:46:56,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:46:56,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:46:56,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:46:56,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:46:56,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:46:56,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:46:56,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:46:56,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:46:56,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:46:56,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:46:56,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:46:56,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:46:56,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:46:56,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:46:56,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:46:56,761 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 -> 150a4f89afb8d47829e7ddadced75f5718c6f777677ea3eeca89c33b976a5a9c [2024-11-07 07:46:57,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:46:57,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:46:57,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:46:57,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:46:57,042 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:46:57,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-31.i [2024-11-07 07:46:58,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:46:58,579 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:46:58,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-31.i [2024-11-07 07:46:58,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85456a787/be6663e826c14242a6ba9f7a95947b93/FLAG4e9ef535e [2024-11-07 07:46:58,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85456a787/be6663e826c14242a6ba9f7a95947b93 [2024-11-07 07:46:58,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:46:58,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:46:58,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:46:58,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:46:58,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:46:58,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:46:58" (1/1) ... [2024-11-07 07:46:58,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2d180e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:58, skipping insertion in model container [2024-11-07 07:46:58,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:46:58" (1/1) ... [2024-11-07 07:46:58,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:46:59,040 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_floatingpointinfluence_no-floats_file-31.i[916,929] [2024-11-07 07:46:59,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:46:59,079 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:46:59,088 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_floatingpointinfluence_no-floats_file-31.i[916,929] [2024-11-07 07:46:59,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:46:59,116 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:46:59,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59 WrapperNode [2024-11-07 07:46:59,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:46:59,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:46:59,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:46:59,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:46:59,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (1/1) ... [2024-11-07 07:46:59,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (1/1) ... [2024-11-07 07:46:59,165 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-07 07:46:59,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:46:59,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:46:59,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:46:59,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:46:59,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (1/1) ... [2024-11-07 07:46:59,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (1/1) ... [2024-11-07 07:46:59,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (1/1) ... [2024-11-07 07:46:59,200 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 07:46:59,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (1/1) ... [2024-11-07 07:46:59,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (1/1) ... [2024-11-07 07:46:59,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (1/1) ... [2024-11-07 07:46:59,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (1/1) ... [2024-11-07 07:46:59,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (1/1) ... [2024-11-07 07:46:59,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (1/1) ... [2024-11-07 07:46:59,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:46:59,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:46:59,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:46:59,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:46:59,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (1/1) ... [2024-11-07 07:46:59,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:46:59,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:46:59,260 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 07:46:59,266 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 07:46:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:46:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:46:59,286 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:46:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:46:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:46:59,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:46:59,358 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:46:59,360 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:46:59,575 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 07:46:59,575 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:46:59,583 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:46:59,583 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:46:59,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:59 BoogieIcfgContainer [2024-11-07 07:46:59,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:46:59,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:46:59,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:46:59,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:46:59,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:46:58" (1/3) ... [2024-11-07 07:46:59,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3932aba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:46:59, skipping insertion in model container [2024-11-07 07:46:59,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:59" (2/3) ... [2024-11-07 07:46:59,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3932aba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:46:59, skipping insertion in model container [2024-11-07 07:46:59,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:59" (3/3) ... [2024-11-07 07:46:59,594 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-31.i [2024-11-07 07:46:59,606 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:46:59,606 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:46:59,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:46:59,662 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;@289545ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:46:59,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:46:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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 07:46:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 07:46:59,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:59,675 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] [2024-11-07 07:46:59,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:59,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:59,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1281230855, now seen corresponding path program 1 times [2024-11-07 07:46:59,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:59,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192596918] [2024-11-07 07:46:59,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:59,960 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 07:46:59,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:59,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192596918] [2024-11-07 07:46:59,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192596918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:59,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:59,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:46:59,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905939203] [2024-11-07 07:46:59,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:59,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:46:59,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:46:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:46:59,987 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 07:47:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:00,009 INFO L93 Difference]: Finished difference Result 84 states and 142 transitions. [2024-11-07 07:47:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:47:00,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 79 [2024-11-07 07:47:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:00,018 INFO L225 Difference]: With dead ends: 84 [2024-11-07 07:47:00,018 INFO L226 Difference]: Without dead ends: 41 [2024-11-07 07:47:00,021 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 07:47:00,025 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:47:00,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:47:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-07 07:47:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-07 07:47:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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 07:47:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-11-07 07:47:00,057 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 79 [2024-11-07 07:47:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:00,057 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-11-07 07:47:00,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 07:47:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-11-07 07:47:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 07:47:00,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:00,064 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] [2024-11-07 07:47:00,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:47:00,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:00,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1670297989, now seen corresponding path program 1 times [2024-11-07 07:47:00,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:47:00,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363462652] [2024-11-07 07:47:00,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:00,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:47:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:47:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:47:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:47:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:47:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:47:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:47:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:47:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:47:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:47:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:47:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:47:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:47:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:01,659 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 07:47:01,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:47:01,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363462652] [2024-11-07 07:47:01,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363462652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:47:01,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:47:01,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:47:01,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868210574] [2024-11-07 07:47:01,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:47:01,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:47:01,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:47:01,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:47:01,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:47:01,663 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 07:47:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:01,881 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2024-11-07 07:47:01,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:47:01,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 79 [2024-11-07 07:47:01,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:01,886 INFO L225 Difference]: With dead ends: 58 [2024-11-07 07:47:01,886 INFO L226 Difference]: Without dead ends: 56 [2024-11-07 07:47:01,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:47:01,887 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 48 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:47:01,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 212 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:47:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-07 07:47:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-11-07 07:47:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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 07:47:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-07 07:47:01,903 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 79 [2024-11-07 07:47:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:01,904 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-07 07:47:01,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 07:47:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2024-11-07 07:47:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 07:47:01,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:01,907 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] [2024-11-07 07:47:01,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:47:01,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:01,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:01,908 INFO L85 PathProgramCache]: Analyzing trace with hash -186128321, now seen corresponding path program 1 times [2024-11-07 07:47:01,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:47:01,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693171172] [2024-11-07 07:47:01,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:01,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:47:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:47:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:47:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:47:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:47:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:47:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:47:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:47:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:47:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:47:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:47:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:47:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:47:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:03,070 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 07:47:03,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:47:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693171172] [2024-11-07 07:47:03,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693171172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:47:03,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:47:03,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:47:03,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728885719] [2024-11-07 07:47:03,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:47:03,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:47:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:47:03,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:47:03,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:47:03,073 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 07:47:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:03,359 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2024-11-07 07:47:03,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:47:03,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 80 [2024-11-07 07:47:03,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:03,360 INFO L225 Difference]: With dead ends: 63 [2024-11-07 07:47:03,361 INFO L226 Difference]: Without dead ends: 61 [2024-11-07 07:47:03,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:47:03,362 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 42 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:47:03,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 249 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:47:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-07 07:47:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2024-11-07 07:47:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 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 07:47:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-07 07:47:03,369 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 80 [2024-11-07 07:47:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:03,369 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-07 07:47:03,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 07:47:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-07 07:47:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 07:47:03,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:03,374 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] [2024-11-07 07:47:03,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:47:03,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:03,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:03,375 INFO L85 PathProgramCache]: Analyzing trace with hash -184281279, now seen corresponding path program 1 times [2024-11-07 07:47:03,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:47:03,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591393135] [2024-11-07 07:47:03,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:03,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:47:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:47:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:47:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:47:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:47:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:47:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:47:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:47:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:47:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:47:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:47:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:47:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:47:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:04,631 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 07:47:04,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:47:04,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591393135] [2024-11-07 07:47:04,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591393135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:47:04,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:47:04,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:47:04,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118221032] [2024-11-07 07:47:04,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:47:04,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:47:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:47:04,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:47:04,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:47:04,633 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 07:47:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:04,870 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-11-07 07:47:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:47:04,870 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 80 [2024-11-07 07:47:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:04,872 INFO L225 Difference]: With dead ends: 61 [2024-11-07 07:47:04,872 INFO L226 Difference]: Without dead ends: 59 [2024-11-07 07:47:04,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:47:04,873 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:47:04,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 193 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:47:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-07 07:47:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2024-11-07 07:47:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 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 07:47:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-07 07:47:04,886 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 80 [2024-11-07 07:47:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:04,888 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-07 07:47:04,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 07:47:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-07 07:47:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 07:47:04,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:04,889 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] [2024-11-07 07:47:04,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:47:04,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:04,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash 11442069, now seen corresponding path program 1 times [2024-11-07 07:47:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:47:04,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36551466] [2024-11-07 07:47:04,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:04,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:47:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:47:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:47:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:47:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:47:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:47:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:47:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:47:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:47:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:47:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:47:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:47:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:47:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:05,538 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 07:47:05,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:47:05,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36551466] [2024-11-07 07:47:05,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36551466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:47:05,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:47:05,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:47:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261520722] [2024-11-07 07:47:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:47:05,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:47:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:47:05,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:47:05,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:47:05,542 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 07:47:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:05,964 INFO L93 Difference]: Finished difference Result 136 states and 171 transitions. [2024-11-07 07:47:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 07:47:05,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 80 [2024-11-07 07:47:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:05,967 INFO L225 Difference]: With dead ends: 136 [2024-11-07 07:47:05,969 INFO L226 Difference]: Without dead ends: 134 [2024-11-07 07:47:05,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-07 07:47:05,970 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 97 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:47:05,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 457 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:47:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-07 07:47:05,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 83. [2024-11-07 07:47:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.305084745762712) internal successors, (77), 60 states have internal predecessors, (77), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 07:47:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-11-07 07:47:05,988 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 80 [2024-11-07 07:47:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:05,988 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-11-07 07:47:05,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 07:47:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-11-07 07:47:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 07:47:05,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:05,989 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] [2024-11-07 07:47:05,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:47:05,990 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:05,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:05,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1492685350, now seen corresponding path program 1 times [2024-11-07 07:47:05,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:47:05,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316128398] [2024-11-07 07:47:05,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:47:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:47:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:47:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:47:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:47:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:47:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:47:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:47:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:47:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:47:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:47:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:47:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:47:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-07 07:47:06,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:47:06,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316128398] [2024-11-07 07:47:06,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316128398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:47:06,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283571597] [2024-11-07 07:47:06,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:06,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:47:06,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:47:06,126 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:47:06,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 07:47:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:06,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:47:06,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:47:06,300 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 07:47:06,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:47:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-07 07:47:06,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283571597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:47:06,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:47:06,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-07 07:47:06,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567902437] [2024-11-07 07:47:06,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:47:06,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:47:06,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:47:06,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:47:06,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:47:06,435 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-11-07 07:47:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:06,557 INFO L93 Difference]: Finished difference Result 160 states and 216 transitions. [2024-11-07 07:47:06,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:47:06,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 81 [2024-11-07 07:47:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:06,558 INFO L225 Difference]: With dead ends: 160 [2024-11-07 07:47:06,559 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 07:47:06,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:47:06,560 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:47:06,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 62 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:47:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 07:47:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 07:47:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 07:47:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 07:47:06,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2024-11-07 07:47:06,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:06,563 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 07:47:06,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-11-07 07:47:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 07:47:06,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 07:47:06,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:47:06,585 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 07:47:06,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:47:06,770 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 07:47:06,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 07:47:07,068 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:47:07,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:47:07 BoogieIcfgContainer [2024-11-07 07:47:07,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:47:07,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:47:07,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:47:07,085 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:47:07,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:59" (3/4) ... [2024-11-07 07:47:07,087 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 07:47:07,092 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 07:47:07,095 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 07:47:07,095 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 07:47:07,095 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 07:47:07,096 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 07:47:07,174 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 07:47:07,175 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 07:47:07,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:47:07,178 INFO L158 Benchmark]: Toolchain (without parser) took 8268.08ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 91.5MB in the beginning and 136.0MB in the end (delta: -44.5MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2024-11-07 07:47:07,178 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:47:07,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.76ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 79.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:47:07,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.06ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:47:07,178 INFO L158 Benchmark]: Boogie Preprocessor took 52.42ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:47:07,179 INFO L158 Benchmark]: RCFGBuilder took 360.99ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 60.7MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:47:07,180 INFO L158 Benchmark]: TraceAbstraction took 7497.81ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 60.2MB in the beginning and 142.0MB in the end (delta: -81.9MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. [2024-11-07 07:47:07,180 INFO L158 Benchmark]: Witness Printer took 89.92ms. Allocated memory is still 201.3MB. Free memory was 142.0MB in the beginning and 136.0MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:47:07,182 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.19ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.76ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 79.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.06ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.42ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 360.99ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 60.7MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7497.81ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 60.2MB in the beginning and 142.0MB in the end (delta: -81.9MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. * Witness Printer took 89.92ms. Allocated memory is still 201.3MB. Free memory was 142.0MB in the beginning and 136.0MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 1231 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 904 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 618 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 327 mSDtfsCounter, 618 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 377 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=5, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 90 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 633 ConstructedInterpolants, 0 QuantifiedInterpolants, 1572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 2031/2112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((1073741822 <= var_1_3) && ((var_1_9 == var_1_12) || (((long long) var_1_8 * last_1_var_1_7) < ((long long) var_1_3 + 1)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && (((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_13 == \old(last_1_var_1_13)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 07:47:07,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE