./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.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-18.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', '6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3'] 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-18.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 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:45:31,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:45:31,931 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:45:31,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:45:31,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:45:31,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:45:31,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:45:31,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:45:31,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:45:31,957 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:45:31,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:45:31,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:45:31,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:45:31,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:45:31,958 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:45:31,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:45:31,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:45:31,958 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:45:31,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:45:31,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:45:31,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:45:31,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:45:31,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:45:31,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:45:31,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:45:31,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:45:31,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:45:31,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:45:31,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:45:31,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:45:31,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:45:31,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:45:31,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:45:31,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:45:31,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:45:31,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:45:31,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:45:31,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:45:31,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:45:31,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:45:31,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:45:31,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:45:31,960 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 -> 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 [2024-11-07 07:45:32,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:45:32,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:45:32,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:45:32,251 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:45:32,251 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:45:32,253 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-18.i [2024-11-07 07:45:33,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:45:33,796 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:45:33,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i [2024-11-07 07:45:33,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccaecf729/2fc4ba68ca774bcea3a729e0c791251d/FLAG612f71772 [2024-11-07 07:45:33,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccaecf729/2fc4ba68ca774bcea3a729e0c791251d [2024-11-07 07:45:33,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:45:33,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:45:33,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:45:33,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:45:33,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:45:33,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:45:33" (1/1) ... [2024-11-07 07:45:33,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ed1211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:33, skipping insertion in model container [2024-11-07 07:45:33,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:45:33" (1/1) ... [2024-11-07 07:45:33,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:45:33,981 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-18.i[916,929] [2024-11-07 07:45:34,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:45:34,024 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:45:34,032 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-18.i[916,929] [2024-11-07 07:45:34,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:45:34,066 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:45:34,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:34 WrapperNode [2024-11-07 07:45:34,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:45:34,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:45:34,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:45:34,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:45:34,074 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:45:34" (1/1) ... [2024-11-07 07:45:34,087 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:45:34" (1/1) ... [2024-11-07 07:45:34,124 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-11-07 07:45:34,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:45:34,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:45:34,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:45:34,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:45:34,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:34" (1/1) ... [2024-11-07 07:45:34,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:34" (1/1) ... [2024-11-07 07:45:34,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:34" (1/1) ... [2024-11-07 07:45:34,158 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:45:34,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:34" (1/1) ... [2024-11-07 07:45:34,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:34" (1/1) ... [2024-11-07 07:45:34,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:34" (1/1) ... [2024-11-07 07:45:34,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:34" (1/1) ... [2024-11-07 07:45:34,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:34" (1/1) ... [2024-11-07 07:45:34,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:34" (1/1) ... [2024-11-07 07:45:34,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:45:34,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:45:34,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:45:34,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:45:34,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:34" (1/1) ... [2024-11-07 07:45:34,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:45:34,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:45:34,215 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:45:34,218 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:45:34,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:45:34,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:45:34,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:45:34,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:45:34,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:45:34,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:45:34,317 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:45:34,320 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:45:34,748 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-07 07:45:34,748 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:45:34,757 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:45:34,757 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:45:34,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:45:34 BoogieIcfgContainer [2024-11-07 07:45:34,758 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:45:34,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:45:34,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:45:34,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:45:34,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:45:33" (1/3) ... [2024-11-07 07:45:34,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c1f3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:45:34, skipping insertion in model container [2024-11-07 07:45:34,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:34" (2/3) ... [2024-11-07 07:45:34,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c1f3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:45:34, skipping insertion in model container [2024-11-07 07:45:34,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:45:34" (3/3) ... [2024-11-07 07:45:34,767 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-18.i [2024-11-07 07:45:34,781 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:45:34,782 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:45:34,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:45:34,854 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;@72dafb0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:45:34,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:45:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:45:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 07:45:34,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:34,871 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:34,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:34,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:34,879 INFO L85 PathProgramCache]: Analyzing trace with hash 706320886, now seen corresponding path program 1 times [2024-11-07 07:45:34,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:34,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731002523] [2024-11-07 07:45:34,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:34,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:45:35,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:35,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731002523] [2024-11-07 07:45:35,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731002523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:35,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:35,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:45:35,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629247130] [2024-11-07 07:45:35,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:35,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:45:35,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:35,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:45:35,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:45:35,185 INFO L87 Difference]: Start difference. First operand has 66 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 07:45:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:35,203 INFO L93 Difference]: Finished difference Result 125 states and 206 transitions. [2024-11-07 07:45:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:45:35,205 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2024-11-07 07:45:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:35,213 INFO L225 Difference]: With dead ends: 125 [2024-11-07 07:45:35,214 INFO L226 Difference]: Without dead ends: 62 [2024-11-07 07:45:35,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:45:35,221 INFO L432 NwaCegarLoop]: 92 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, 92 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:45:35,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:45:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-07 07:45:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-07 07:45:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:45:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2024-11-07 07:45:35,260 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 97 [2024-11-07 07:45:35,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:35,261 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 92 transitions. [2024-11-07 07:45:35,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 07:45:35,261 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2024-11-07 07:45:35,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 07:45:35,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:35,266 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:35,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:45:35,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:35,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash 40784694, now seen corresponding path program 1 times [2024-11-07 07:45:35,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:35,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266362989] [2024-11-07 07:45:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:45:35,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:35,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266362989] [2024-11-07 07:45:35,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266362989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:35,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:35,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:45:35,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564171367] [2024-11-07 07:45:35,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:35,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:45:35,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:35,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:45:35,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:45:35,846 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:36,047 INFO L93 Difference]: Finished difference Result 180 states and 270 transitions. [2024-11-07 07:45:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:45:36,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-07 07:45:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:36,050 INFO L225 Difference]: With dead ends: 180 [2024-11-07 07:45:36,050 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 07:45:36,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:45:36,051 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 56 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:45:36,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 141 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:45:36,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 07:45:36,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2024-11-07 07:45:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 07:45:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-11-07 07:45:36,086 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 97 [2024-11-07 07:45:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:36,087 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-11-07 07:45:36,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-11-07 07:45:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 07:45:36,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:36,090 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:36,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:45:36,091 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:36,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1415898669, now seen corresponding path program 1 times [2024-11-07 07:45:36,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:36,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722141705] [2024-11-07 07:45:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:36,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,761 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 07:45:36,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:36,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722141705] [2024-11-07 07:45:36,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722141705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:45:36,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679447606] [2024-11-07 07:45:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:36,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:45:36,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:45:36,764 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:45:36,766 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:45:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:36,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 07:45:36,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:45:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:45:37,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:45:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 07:45:37,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679447606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:45:37,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:45:37,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-11-07 07:45:37,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710634421] [2024-11-07 07:45:37,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:45:37,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 07:45:37,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:37,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 07:45:37,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-11-07 07:45:37,849 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-07 07:45:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:38,984 INFO L93 Difference]: Finished difference Result 378 states and 545 transitions. [2024-11-07 07:45:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 07:45:38,985 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) Word has length 98 [2024-11-07 07:45:38,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:38,988 INFO L225 Difference]: With dead ends: 378 [2024-11-07 07:45:38,988 INFO L226 Difference]: Without dead ends: 263 [2024-11-07 07:45:38,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2024-11-07 07:45:38,993 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 343 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 07:45:38,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 449 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 07:45:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-07 07:45:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 253. [2024-11-07 07:45:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 188 states have (on average 1.2234042553191489) internal successors, (230), 188 states have internal predecessors, (230), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 07:45:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 342 transitions. [2024-11-07 07:45:39,032 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 342 transitions. Word has length 98 [2024-11-07 07:45:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:39,033 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 342 transitions. [2024-11-07 07:45:39,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-07 07:45:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 342 transitions. [2024-11-07 07:45:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 07:45:39,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:39,035 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:39,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 07:45:39,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:45:39,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:39,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash -802091189, now seen corresponding path program 1 times [2024-11-07 07:45:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:39,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244647461] [2024-11-07 07:45:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:45:43,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:43,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244647461] [2024-11-07 07:45:43,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244647461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:43,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:43,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 07:45:43,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940642959] [2024-11-07 07:45:43,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:43,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 07:45:43,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:43,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 07:45:43,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:45:43,462 INFO L87 Difference]: Start difference. First operand 253 states and 342 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:47,072 INFO L93 Difference]: Finished difference Result 669 states and 886 transitions. [2024-11-07 07:45:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 07:45:47,075 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-11-07 07:45:47,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:47,078 INFO L225 Difference]: With dead ends: 669 [2024-11-07 07:45:47,078 INFO L226 Difference]: Without dead ends: 419 [2024-11-07 07:45:47,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2024-11-07 07:45:47,086 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 330 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:45:47,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 616 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 07:45:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-07 07:45:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 266. [2024-11-07 07:45:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 201 states have (on average 1.228855721393035) internal successors, (247), 201 states have internal predecessors, (247), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 07:45:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 359 transitions. [2024-11-07 07:45:47,144 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 359 transitions. Word has length 99 [2024-11-07 07:45:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:47,146 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 359 transitions. [2024-11-07 07:45:47,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 359 transitions. [2024-11-07 07:45:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 07:45:47,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:47,148 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:47,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:45:47,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:47,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:47,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1823159543, now seen corresponding path program 1 times [2024-11-07 07:45:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:47,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132258036] [2024-11-07 07:45:47,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:45:49,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:49,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132258036] [2024-11-07 07:45:49,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132258036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:49,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:49,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 07:45:49,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147279024] [2024-11-07 07:45:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:49,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 07:45:49,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:49,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 07:45:49,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:45:49,900 INFO L87 Difference]: Start difference. First operand 266 states and 359 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:52,632 INFO L93 Difference]: Finished difference Result 557 states and 732 transitions. [2024-11-07 07:45:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 07:45:52,633 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-11-07 07:45:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:52,636 INFO L225 Difference]: With dead ends: 557 [2024-11-07 07:45:52,636 INFO L226 Difference]: Without dead ends: 429 [2024-11-07 07:45:52,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2024-11-07 07:45:52,638 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 312 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:45:52,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 655 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 07:45:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-07 07:45:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 266. [2024-11-07 07:45:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 201 states have (on average 1.2189054726368158) internal successors, (245), 201 states have internal predecessors, (245), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 07:45:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 357 transitions. [2024-11-07 07:45:52,677 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 357 transitions. Word has length 99 [2024-11-07 07:45:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:52,677 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 357 transitions. [2024-11-07 07:45:52,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 357 transitions. [2024-11-07 07:45:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 07:45:52,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:52,679 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:52,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:45:52,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:52,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash -446300746, now seen corresponding path program 1 times [2024-11-07 07:45:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:52,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766196642] [2024-11-07 07:45:52,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:45:52,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:52,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766196642] [2024-11-07 07:45:52,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766196642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:52,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:52,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:45:52,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305326390] [2024-11-07 07:45:52,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:52,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:45:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:52,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:45:52,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:45:52,776 INFO L87 Difference]: Start difference. First operand 266 states and 357 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:52,805 INFO L93 Difference]: Finished difference Result 534 states and 721 transitions. [2024-11-07 07:45:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:45:52,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 100 [2024-11-07 07:45:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:52,808 INFO L225 Difference]: With dead ends: 534 [2024-11-07 07:45:52,808 INFO L226 Difference]: Without dead ends: 271 [2024-11-07 07:45:52,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:45:52,809 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:45:52,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:45:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-07 07:45:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2024-11-07 07:45:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 204 states have (on average 1.2156862745098038) internal successors, (248), 204 states have internal predecessors, (248), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 07:45:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 360 transitions. [2024-11-07 07:45:52,843 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 360 transitions. Word has length 100 [2024-11-07 07:45:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:52,844 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 360 transitions. [2024-11-07 07:45:52,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 360 transitions. [2024-11-07 07:45:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 07:45:52,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:52,845 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:52,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:45:52,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:52,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:52,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1450329062, now seen corresponding path program 1 times [2024-11-07 07:45:52,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:52,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922470121] [2024-11-07 07:45:52,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:52,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,210 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:45:53,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:53,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922470121] [2024-11-07 07:45:53,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922470121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:53,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:53,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:45:53,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465656000] [2024-11-07 07:45:53,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:53,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:45:53,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:53,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:45:53,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:45:53,213 INFO L87 Difference]: Start difference. First operand 269 states and 360 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:53,357 INFO L93 Difference]: Finished difference Result 331 states and 432 transitions. [2024-11-07 07:45:53,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:45:53,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 101 [2024-11-07 07:45:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:53,360 INFO L225 Difference]: With dead ends: 331 [2024-11-07 07:45:53,360 INFO L226 Difference]: Without dead ends: 329 [2024-11-07 07:45:53,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:45:53,360 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 24 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:45:53,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 323 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:45:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-07 07:45:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 315. [2024-11-07 07:45:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 250 states have (on average 1.208) internal successors, (302), 250 states have internal predecessors, (302), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 07:45:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 414 transitions. [2024-11-07 07:45:53,390 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 414 transitions. Word has length 101 [2024-11-07 07:45:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:53,391 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 414 transitions. [2024-11-07 07:45:53,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 414 transitions. [2024-11-07 07:45:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 07:45:53,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:53,392 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:53,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:45:53,392 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:53,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1237690056, now seen corresponding path program 1 times [2024-11-07 07:45:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:53,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057602081] [2024-11-07 07:45:53,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:53,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:45:53,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:53,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057602081] [2024-11-07 07:45:53,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057602081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:53,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:53,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:45:53,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763436627] [2024-11-07 07:45:53,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:53,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:45:53,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:53,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:45:53,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:45:53,462 INFO L87 Difference]: Start difference. First operand 315 states and 414 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:53,538 INFO L93 Difference]: Finished difference Result 535 states and 710 transitions. [2024-11-07 07:45:53,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:45:53,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 101 [2024-11-07 07:45:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:53,542 INFO L225 Difference]: With dead ends: 535 [2024-11-07 07:45:53,543 INFO L226 Difference]: Without dead ends: 367 [2024-11-07 07:45:53,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:45:53,545 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 71 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:45:53,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 125 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:45:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-07 07:45:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 275. [2024-11-07 07:45:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 210 states have (on average 1.1952380952380952) internal successors, (251), 210 states have internal predecessors, (251), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 07:45:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 363 transitions. [2024-11-07 07:45:53,576 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 363 transitions. Word has length 101 [2024-11-07 07:45:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:53,577 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 363 transitions. [2024-11-07 07:45:53,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 363 transitions. [2024-11-07 07:45:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:45:53,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:53,578 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:53,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:45:53,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:53,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:53,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1939730637, now seen corresponding path program 1 times [2024-11-07 07:45:53,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:53,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563988355] [2024-11-07 07:45:53,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:53,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:45:53,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:53,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563988355] [2024-11-07 07:45:53,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563988355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:53,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:53,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:45:53,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986771006] [2024-11-07 07:45:53,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:53,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:45:53,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:53,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:45:53,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:45:53,637 INFO L87 Difference]: Start difference. First operand 275 states and 363 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:53,711 INFO L93 Difference]: Finished difference Result 420 states and 552 transitions. [2024-11-07 07:45:53,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:45:53,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 102 [2024-11-07 07:45:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:53,714 INFO L225 Difference]: With dead ends: 420 [2024-11-07 07:45:53,714 INFO L226 Difference]: Without dead ends: 282 [2024-11-07 07:45:53,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:45:53,715 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 57 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:45:53,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 180 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:45:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-07 07:45:53,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2024-11-07 07:45:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 214 states have (on average 1.1775700934579438) internal successors, (252), 214 states have internal predecessors, (252), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 07:45:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 364 transitions. [2024-11-07 07:45:53,761 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 364 transitions. Word has length 102 [2024-11-07 07:45:53,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:53,761 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 364 transitions. [2024-11-07 07:45:53,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 364 transitions. [2024-11-07 07:45:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:45:53,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:53,763 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:53,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 07:45:53,763 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:53,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1677217209, now seen corresponding path program 1 times [2024-11-07 07:45:53,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:53,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396246938] [2024-11-07 07:45:53,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:53,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:45:54,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:54,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396246938] [2024-11-07 07:45:54,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396246938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:54,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:54,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 07:45:54,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921526654] [2024-11-07 07:45:54,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:54,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 07:45:54,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:54,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 07:45:54,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:45:54,397 INFO L87 Difference]: Start difference. First operand 279 states and 364 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:54,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:54,685 INFO L93 Difference]: Finished difference Result 531 states and 680 transitions. [2024-11-07 07:45:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:45:54,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 103 [2024-11-07 07:45:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:54,688 INFO L225 Difference]: With dead ends: 531 [2024-11-07 07:45:54,688 INFO L226 Difference]: Without dead ends: 384 [2024-11-07 07:45:54,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:45:54,690 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 74 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:45:54,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 299 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:45:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-07 07:45:54,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 361. [2024-11-07 07:45:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 280 states have (on average 1.167857142857143) internal successors, (327), 280 states have internal predecessors, (327), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 07:45:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 467 transitions. [2024-11-07 07:45:54,725 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 467 transitions. Word has length 103 [2024-11-07 07:45:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:54,726 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 467 transitions. [2024-11-07 07:45:54,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 467 transitions. [2024-11-07 07:45:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 07:45:54,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:54,727 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:54,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:45:54,727 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:54,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash -13964650, now seen corresponding path program 1 times [2024-11-07 07:45:54,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:54,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678481917] [2024-11-07 07:45:54,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:54,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:45:55,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:55,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678481917] [2024-11-07 07:45:55,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678481917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:55,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:55,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:45:55,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525934774] [2024-11-07 07:45:55,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:55,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:45:55,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:55,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:45:55,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:45:55,128 INFO L87 Difference]: Start difference. First operand 361 states and 467 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:55,420 INFO L93 Difference]: Finished difference Result 548 states and 697 transitions. [2024-11-07 07:45:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:45:55,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2024-11-07 07:45:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:55,424 INFO L225 Difference]: With dead ends: 548 [2024-11-07 07:45:55,424 INFO L226 Difference]: Without dead ends: 401 [2024-11-07 07:45:55,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:45:55,425 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 89 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:45:55,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 390 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:45:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-07 07:45:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 275. [2024-11-07 07:45:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 210 states have (on average 1.1571428571428573) internal successors, (243), 210 states have internal predecessors, (243), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 07:45:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 355 transitions. [2024-11-07 07:45:55,464 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 355 transitions. Word has length 104 [2024-11-07 07:45:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:55,465 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 355 transitions. [2024-11-07 07:45:55,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:45:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 355 transitions. [2024-11-07 07:45:55,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 07:45:55,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:55,467 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:55,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 07:45:55,468 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:55,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:55,468 INFO L85 PathProgramCache]: Analyzing trace with hash 509843510, now seen corresponding path program 1 times [2024-11-07 07:45:55,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:55,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967695431] [2024-11-07 07:45:55,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:55,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:45:55,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525129925] [2024-11-07 07:45:55,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:55,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:45:55,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:45:55,516 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:45:55,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 07:45:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:45:55,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:45:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:45:55,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:45:55,723 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:45:55,724 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:45:55,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 07:45:55,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:45:55,930 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:45:55,999 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:45:56,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:45:56 BoogieIcfgContainer [2024-11-07 07:45:56,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:45:56,004 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:45:56,004 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:45:56,004 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:45:56,005 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:45:34" (3/4) ... [2024-11-07 07:45:56,007 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:45:56,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:45:56,009 INFO L158 Benchmark]: Toolchain (without parser) took 22181.71ms. Allocated memory was 100.7MB in the beginning and 343.9MB in the end (delta: 243.3MB). Free memory was 76.9MB in the beginning and 265.0MB in the end (delta: -188.1MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2024-11-07 07:45:56,010 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 83.9MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:45:56,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.85ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 64.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:45:56,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.40ms. Allocated memory is still 100.7MB. Free memory was 64.0MB in the beginning and 61.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:45:56,011 INFO L158 Benchmark]: Boogie Preprocessor took 59.01ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 58.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:45:56,012 INFO L158 Benchmark]: RCFGBuilder took 572.89ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 74.9MB in the end (delta: -16.7MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-07 07:45:56,012 INFO L158 Benchmark]: TraceAbstraction took 21242.55ms. Allocated memory was 100.7MB in the beginning and 343.9MB in the end (delta: 243.3MB). Free memory was 74.4MB in the beginning and 265.1MB in the end (delta: -190.7MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2024-11-07 07:45:56,012 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 343.9MB. Free memory was 265.1MB in the beginning and 265.0MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:45:56,014 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.77ms. Allocated memory is still 83.9MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.85ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 64.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.40ms. Allocated memory is still 100.7MB. Free memory was 64.0MB in the beginning and 61.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.01ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 58.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 572.89ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 74.9MB in the end (delta: -16.7MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21242.55ms. Allocated memory was 100.7MB in the beginning and 343.9MB in the end (delta: 243.3MB). Free memory was 74.4MB in the beginning and 265.1MB in the end (delta: -190.7MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 343.9MB. Free memory was 265.1MB in the beginning and 265.0MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 91, overapproximation of bitwiseOr at line 91, overapproximation of bitwiseAnd at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 99; [L23] signed short int var_1_7 = 18477; [L24] signed short int var_1_8 = 5; [L25] signed long int var_1_9 = 5; [L26] signed long int var_1_10 = 0; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 256; [L31] unsigned char var_1_15 = 0; [L32] unsigned char last_1_var_1_11 = 16; [L33] unsigned long int last_1_var_1_14 = 256; VAL [isInitial=0, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=18477, var_1_8=5, var_1_9=5] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L87] last_1_var_1_11 = var_1_11 [L88] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=18477, var_1_8=5, var_1_9=5] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L64] var_1_7 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L65] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L66] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L66] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L67] var_1_8 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L69] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L69] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L70] var_1_9 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L71] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L72] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L73] var_1_10 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L74] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L75] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L78] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L81] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L82] var_1_15 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L83] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L84] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L99] RET updateVariables() [L100] CALL step() [L37] signed short int stepLocal_3 = var_1_8; [L38] unsigned long int stepLocal_2 = last_1_var_1_14; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, stepLocal_3=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L39] COND FALSE !(last_1_var_1_14 > stepLocal_3) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L46] EXPR var_1_11 & var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L46] COND FALSE !((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) [L51] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_11; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L54] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L54] unsigned long int stepLocal_0 = var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))); [L55] COND FALSE !(stepLocal_0 != var_1_11) [L60] var_1_1 = 10.5f VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_7=16383, var_1_8=256, var_1_9=0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_7=16383, var_1_8=256, var_1_9=0] [L91] EXPR ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((signed long int) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=19, var_1_7=16383, var_1_8=256, var_1_9=0] [L91-L92] return ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((signed long int) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=19, var_1_7=16383, var_1_8=256, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=19, var_1_7=16383, var_1_8=256, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1356 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1356 mSDsluCounter, 3433 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2433 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3939 IncrementalHoareTripleChecker+Invalid, 4126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 1000 mSDtfsCounter, 3939 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 535 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=10, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 589 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 1409 NumberOfCodeBlocks, 1409 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1284 ConstructedInterpolants, 0 QuantifiedInterpolants, 6878 SizeOfPredicates, 2 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 4615/4732 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 07:45:56,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:45:58,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:45:58,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:45:58,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:45:58,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:45:58,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:45:58,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:45:58,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:45:58,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:45:58,311 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:45:58,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:45:58,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:45:58,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:45:58,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:45:58,312 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:45:58,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:45:58,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:45:58,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:45:58,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:45:58,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:45:58,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:45:58,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:45:58,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:45:58,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:45:58,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:45:58,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:45:58,315 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:45:58,315 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:45:58,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:45:58,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:45:58,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:45:58,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:45:58,315 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 -> 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 [2024-11-07 07:45:58,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:45:58,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:45:58,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:45:58,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:45:58,613 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:45:58,616 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-18.i [2024-11-07 07:45:59,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:46:00,121 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:46:00,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i [2024-11-07 07:46:00,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfa36436e/5cc5925083a541a0b1c9de033aafe45f/FLAGc71c0fb01 [2024-11-07 07:46:00,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfa36436e/5cc5925083a541a0b1c9de033aafe45f [2024-11-07 07:46:00,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:46:00,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:46:00,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:46:00,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:46:00,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:46:00,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:46:00" (1/1) ... [2024-11-07 07:46:00,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2456ff0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:00, skipping insertion in model container [2024-11-07 07:46:00,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:46:00" (1/1) ... [2024-11-07 07:46:00,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:46:00,622 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-18.i[916,929] [2024-11-07 07:46:00,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:46:00,668 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:46:00,676 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-18.i[916,929] [2024-11-07 07:46:00,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:46:00,712 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:46:00,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:00 WrapperNode [2024-11-07 07:46:00,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:46:00,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:46:00,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:46:00,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:46:00,721 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:00" (1/1) ... [2024-11-07 07:46:00,729 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:00" (1/1) ... [2024-11-07 07:46:00,757 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-11-07 07:46:00,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:46:00,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:46:00,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:46:00,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:46:00,766 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:00" (1/1) ... [2024-11-07 07:46:00,767 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:00" (1/1) ... [2024-11-07 07:46:00,775 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:00" (1/1) ... [2024-11-07 07:46:00,789 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:00,789 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:00" (1/1) ... [2024-11-07 07:46:00,789 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:00" (1/1) ... [2024-11-07 07:46:00,802 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:00" (1/1) ... [2024-11-07 07:46:00,805 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:00" (1/1) ... [2024-11-07 07:46:00,807 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:00" (1/1) ... [2024-11-07 07:46:00,807 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:00" (1/1) ... [2024-11-07 07:46:00,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:46:00,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:46:00,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:46:00,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:46:00,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:00" (1/1) ... [2024-11-07 07:46:00,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:46:00,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:46:00,850 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:00,857 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:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:46:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:46:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:46:00,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:46:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:46:00,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:46:00,952 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:46:00,954 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:46:01,212 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 07:46:01,212 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:46:01,220 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:46:01,220 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:46:01,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:01 BoogieIcfgContainer [2024-11-07 07:46:01,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:46:01,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:46:01,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:46:01,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:46:01,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:46:00" (1/3) ... [2024-11-07 07:46:01,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae8d8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:46:01, skipping insertion in model container [2024-11-07 07:46:01,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:00" (2/3) ... [2024-11-07 07:46:01,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae8d8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:46:01, skipping insertion in model container [2024-11-07 07:46:01,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:01" (3/3) ... [2024-11-07 07:46:01,230 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-18.i [2024-11-07 07:46:01,243 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:46:01,244 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:46:01,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:46:01,293 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;@4097ca61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:46:01,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:46:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:46:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 07:46:01,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:01,305 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:01,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:01,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash -890329808, now seen corresponding path program 1 times [2024-11-07 07:46:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:46:01,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089679406] [2024-11-07 07:46:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:01,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:46:01,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:46:01,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:46:01,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 07:46:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:01,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:46:01,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:46:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-07 07:46:01,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:46:01,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:46:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089679406] [2024-11-07 07:46:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089679406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:01,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:01,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:46:01,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879657493] [2024-11-07 07:46:01,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:01,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:46:01,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:46:01,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:46:01,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:46:01,529 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 07:46:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:01,548 INFO L93 Difference]: Finished difference Result 87 states and 146 transitions. [2024-11-07 07:46:01,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:46:01,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2024-11-07 07:46:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:01,554 INFO L225 Difference]: With dead ends: 87 [2024-11-07 07:46:01,554 INFO L226 Difference]: Without dead ends: 43 [2024-11-07 07:46:01,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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:46:01,560 INFO L432 NwaCegarLoop]: 62 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, 62 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:46:01,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:46:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-07 07:46:01,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-07 07:46:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:46:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2024-11-07 07:46:01,597 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 90 [2024-11-07 07:46:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:01,598 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 62 transitions. [2024-11-07 07:46:01,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 07:46:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2024-11-07 07:46:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 07:46:01,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:01,603 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:01,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 07:46:01,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:46:01,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:01,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash -890514448, now seen corresponding path program 1 times [2024-11-07 07:46:01,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:46:01,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408694708] [2024-11-07 07:46:01,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:01,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:46:01,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:46:01,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:46:01,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 07:46:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:01,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 07:46:01,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:46:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:46:02,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:46:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 07:46:03,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:46:03,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408694708] [2024-11-07 07:46:03,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408694708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:46:03,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:46:03,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-07 07:46:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960791871] [2024-11-07 07:46:03,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:46:03,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 07:46:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:46:03,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 07:46:03,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-07 07:46:03,034 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-07 07:46:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:04,429 INFO L93 Difference]: Finished difference Result 223 states and 314 transitions. [2024-11-07 07:46:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 07:46:04,431 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 90 [2024-11-07 07:46:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:04,434 INFO L225 Difference]: With dead ends: 223 [2024-11-07 07:46:04,434 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 07:46:04,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=494, Unknown=0, NotChecked=0, Total=756 [2024-11-07 07:46:04,437 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 132 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:04,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 248 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 07:46:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 07:46:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 92. [2024-11-07 07:46:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 07:46:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2024-11-07 07:46:04,483 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 90 [2024-11-07 07:46:04,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:04,484 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2024-11-07 07:46:04,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-07 07:46:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2024-11-07 07:46:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 07:46:04,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:04,486 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:04,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 07:46:04,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:46:04,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:04,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:04,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2069857370, now seen corresponding path program 1 times [2024-11-07 07:46:04,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:46:04,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525455844] [2024-11-07 07:46:04,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:04,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:46:04,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:46:04,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:46:04,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 07:46:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:04,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 07:46:04,787 INFO L278 TraceCheckSpWp]: Computing forward predicates...