./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1250.c --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/float-newlib/double_req_bl_1250.c', '-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', '358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2'] 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/float-newlib/double_req_bl_1250.c -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 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 21:01:11,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 21:01:11,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 21:01:11,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 21:01:11,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 21:01:11,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 21:01:11,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 21:01:11,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 21:01:11,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 21:01:11,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 21:01:11,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 21:01:11,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 21:01:11,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 21:01:11,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 21:01:11,768 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 21:01:11,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 21:01:11,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 21:01:11,770 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 21:01:11,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 21:01:11,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 21:01:11,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 21:01:11,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 21:01:11,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 21:01:11,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 21:01:11,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 21:01:11,770 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 21:01:11,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 21:01:11,770 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 21:01:11,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 21:01:11,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 21:01:11,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 21:01:11,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 21:01:11,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:01:11,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 21:01:11,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 21:01:11,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 21:01:11,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 21:01:11,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 21:01:11,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 21:01:11,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 21:01:11,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 21:01:11,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 21:01:11,771 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 -> 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 [2024-11-06 21:01:12,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 21:01:12,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 21:01:12,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 21:01:12,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 21:01:12,062 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 21:01:12,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2024-11-06 21:01:13,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 21:01:13,643 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 21:01:13,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2024-11-06 21:01:13,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86c7df2eb/0ea980a45d0041539fb8fbbeb0110720/FLAG913d8a2e1 [2024-11-06 21:01:13,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86c7df2eb/0ea980a45d0041539fb8fbbeb0110720 [2024-11-06 21:01:13,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 21:01:13,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 21:01:13,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 21:01:13,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 21:01:13,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 21:01:13,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:13,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5b9f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13, skipping insertion in model container [2024-11-06 21:01:13,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:13,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 21:01:13,864 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/float-newlib/double_req_bl_1250.c[1965,1978] [2024-11-06 21:01:13,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:01:13,879 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 21:01:13,900 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/float-newlib/double_req_bl_1250.c[1965,1978] [2024-11-06 21:01:13,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:01:13,915 INFO L204 MainTranslator]: Completed translation [2024-11-06 21:01:13,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13 WrapperNode [2024-11-06 21:01:13,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 21:01:13,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 21:01:13,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 21:01:13,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 21:01:13,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:13,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:13,948 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2024-11-06 21:01:13,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 21:01:13,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 21:01:13,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 21:01:13,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 21:01:13,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:13,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:13,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:13,982 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-06 21:01:13,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:13,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:13,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:14,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:14,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:14,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:14,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 21:01:14,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 21:01:14,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 21:01:14,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 21:01:14,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (1/1) ... [2024-11-06 21:01:14,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:01:14,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 21:01:14,043 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-06 21:01:14,050 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-06 21:01:14,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 21:01:14,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 21:01:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 21:01:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 21:01:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-06 21:01:14,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-06 21:01:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-06 21:01:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-06 21:01:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 21:01:14,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 21:01:14,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 21:01:14,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 21:01:14,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 21:01:14,161 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 21:01:14,163 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 21:01:14,359 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-06 21:01:14,359 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 21:01:14,367 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 21:01:14,368 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 21:01:14,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:14 BoogieIcfgContainer [2024-11-06 21:01:14,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 21:01:14,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 21:01:14,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 21:01:14,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 21:01:14,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:01:13" (1/3) ... [2024-11-06 21:01:14,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a6955f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:01:14, skipping insertion in model container [2024-11-06 21:01:14,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:13" (2/3) ... [2024-11-06 21:01:14,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a6955f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:01:14, skipping insertion in model container [2024-11-06 21:01:14,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:14" (3/3) ... [2024-11-06 21:01:14,378 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2024-11-06 21:01:14,392 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 21:01:14,392 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 21:01:14,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 21:01:14,449 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;@179a48f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 21:01:14,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 21:01:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:01:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 21:01:14,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:14,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:14,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:14,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1998704113, now seen corresponding path program 1 times [2024-11-06 21:01:14,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:01:14,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429649071] [2024-11-06 21:01:14,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:14,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:01:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:14,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:01:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:01:14,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:01:14,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429649071] [2024-11-06 21:01:14,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429649071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:14,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:14,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 21:01:14,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314095447] [2024-11-06 21:01:14,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:14,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 21:01:14,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:01:14,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 21:01:14,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 21:01:14,688 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:14,730 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2024-11-06 21:01:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 21:01:14,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-06 21:01:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:14,736 INFO L225 Difference]: With dead ends: 47 [2024-11-06 21:01:14,736 INFO L226 Difference]: Without dead ends: 22 [2024-11-06 21:01:14,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:01:14,740 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:14,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-06 21:01:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-06 21:01:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:01:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-11-06 21:01:14,765 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 14 [2024-11-06 21:01:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:14,765 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-06 21:01:14,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-11-06 21:01:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 21:01:14,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:14,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:14,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 21:01:14,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:14,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash -259779316, now seen corresponding path program 1 times [2024-11-06 21:01:14,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:01:14,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861849160] [2024-11-06 21:01:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:14,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:01:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:14,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:01:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:01:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:01:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861849160] [2024-11-06 21:01:15,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861849160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:15,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:15,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:01:15,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960249314] [2024-11-06 21:01:15,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:15,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:01:15,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:01:15,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:01:15,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:01:15,004 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:15,039 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-06 21:01:15,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:01:15,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-06 21:01:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:15,041 INFO L225 Difference]: With dead ends: 31 [2024-11-06 21:01:15,041 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 21:01:15,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:01:15,042 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:15,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 21:01:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-06 21:01:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-06 21:01:15,051 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 15 [2024-11-06 21:01:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:15,052 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-06 21:01:15,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-06 21:01:15,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 21:01:15,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:15,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:15,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 21:01:15,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:15,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:15,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1459037804, now seen corresponding path program 1 times [2024-11-06 21:01:15,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:01:15,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616953896] [2024-11-06 21:01:15,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:15,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:01:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:15,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:01:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:01:15,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:01:15,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616953896] [2024-11-06 21:01:15,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616953896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:15,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:15,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:01:15,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268001565] [2024-11-06 21:01:15,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:15,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:01:15,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:01:15,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:01:15,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:01:15,230 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:15,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:15,266 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-06 21:01:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:01:15,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-06 21:01:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:15,268 INFO L225 Difference]: With dead ends: 35 [2024-11-06 21:01:15,268 INFO L226 Difference]: Without dead ends: 30 [2024-11-06 21:01:15,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:01:15,269 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:15,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-06 21:01:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-06 21:01:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-06 21:01:15,276 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 16 [2024-11-06 21:01:15,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:15,276 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-06 21:01:15,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-06 21:01:15,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 21:01:15,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:15,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:15,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 21:01:15,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:15,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:15,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1378771472, now seen corresponding path program 1 times [2024-11-06 21:01:15,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:01:15,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786494500] [2024-11-06 21:01:15,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:15,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:01:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:15,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:01:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:01:15,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:01:15,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786494500] [2024-11-06 21:01:15,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786494500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:15,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:15,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:01:15,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959629737] [2024-11-06 21:01:15,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:15,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:01:15,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:01:15,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:01:15,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:01:15,451 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:15,501 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-06 21:01:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:01:15,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-06 21:01:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:15,502 INFO L225 Difference]: With dead ends: 35 [2024-11-06 21:01:15,502 INFO L226 Difference]: Without dead ends: 30 [2024-11-06 21:01:15,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:01:15,503 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:15,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-06 21:01:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-06 21:01:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-06 21:01:15,512 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2024-11-06 21:01:15,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:15,513 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-06 21:01:15,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-06 21:01:15,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 21:01:15,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:15,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:15,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 21:01:15,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:15,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:15,515 INFO L85 PathProgramCache]: Analyzing trace with hash 516662552, now seen corresponding path program 1 times [2024-11-06 21:01:15,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:01:15,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325533967] [2024-11-06 21:01:15,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:15,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:01:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:15,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:01:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:01:15,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:01:15,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325533967] [2024-11-06 21:01:15,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325533967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:15,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:15,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:01:15,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060590969] [2024-11-06 21:01:15,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:15,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:01:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:01:15,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:01:15,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:01:15,658 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:15,695 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-06 21:01:15,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:01:15,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-06 21:01:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:15,698 INFO L225 Difference]: With dead ends: 35 [2024-11-06 21:01:15,698 INFO L226 Difference]: Without dead ends: 30 [2024-11-06 21:01:15,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:01:15,698 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:15,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-06 21:01:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-06 21:01:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-06 21:01:15,705 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 18 [2024-11-06 21:01:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:15,705 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-06 21:01:15,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-06 21:01:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 21:01:15,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:15,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:15,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 21:01:15,707 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:15,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1290791911, now seen corresponding path program 1 times [2024-11-06 21:01:15,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:01:15,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927155526] [2024-11-06 21:01:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:15,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:01:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 21:01:15,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 21:01:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 21:01:15,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 21:01:15,765 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 21:01:15,766 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 21:01:15,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 21:01:15,770 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-06 21:01:15,783 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 21:01:15,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:01:15 BoogieIcfgContainer [2024-11-06 21:01:15,786 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 21:01:15,786 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 21:01:15,786 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 21:01:15,787 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 21:01:15,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:14" (3/4) ... [2024-11-06 21:01:15,791 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-06 21:01:15,791 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 21:01:15,792 INFO L158 Benchmark]: Toolchain (without parser) took 2118.82ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 36.5MB in the end (delta: 40.7MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2024-11-06 21:01:15,792 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:01:15,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.16ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 65.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:15,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.70ms. Allocated memory is still 100.7MB. Free memory was 65.5MB in the beginning and 64.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:01:15,793 INFO L158 Benchmark]: Boogie Preprocessor took 58.29ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 62.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:15,793 INFO L158 Benchmark]: RCFGBuilder took 360.41ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 50.8MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:15,793 INFO L158 Benchmark]: TraceAbstraction took 1414.92ms. Allocated memory is still 100.7MB. Free memory was 50.2MB in the beginning and 37.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-06 21:01:15,794 INFO L158 Benchmark]: Witness Printer took 5.24ms. Allocated memory is still 100.7MB. Free memory was 37.1MB in the beginning and 36.5MB in the end (delta: 603.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:01:15,797 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.17ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.16ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 65.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.70ms. Allocated memory is still 100.7MB. Free memory was 65.5MB in the beginning and 64.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.29ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 62.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 360.41ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 50.8MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1414.92ms. Allocated memory is still 100.7MB. Free memory was 50.2MB in the beginning and 37.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Witness Printer took 5.24ms. Allocated memory is still 100.7MB. Free memory was 37.1MB in the beginning and 36.5MB in the end (delta: 603.4kB). 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: 74]: 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 someBinaryDOUBLEComparisonOperation at line 18, overapproximation of someBinaryArithmeticDOUBLEoperation at line 69. Possible FailurePath: [L69] double x = 0.0 / 0.0; [L70] double y = 0.0 / 0.0; [L71] CALL, EXPR fmax_double(x, y) [L57] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967307] [L29] __uint32_t msw, lsw; VAL [\old(x)=4294967307, x=4294967307] [L32] ieee_double_shape_type ew_u; [L33] ew_u.value = (x) [L34] EXPR ew_u.parts.msw [L34] (msw) = ew_u.parts.msw [L35] EXPR ew_u.parts.lsw [L35] (lsw) = ew_u.parts.lsw [L38-L39] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967307, lsw=4294967297, msw=2146435073, x=4294967307] [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967307, lsw=4294967297, msw=2146435073, x=4294967307] [L44-L45] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967307, lsw=4294967297, msw=2146435073, x=4294967307] [L48-L49] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L52] return 0; VAL [\old(x)=4294967307, \result=0, x=4294967307] [L57] RET, EXPR __fpclassify_double(x) VAL [x=4294967307, y=4294967306] [L57] COND TRUE __fpclassify_double(x) == 0 [L58] return y; VAL [\result=4294967306, x=4294967307] [L71] RET, EXPR fmax_double(x, y) [L71] double res = fmax_double(x, y); [L73] CALL, EXPR isnan_double(res) [L18] return x != x; VAL [\result=0] [L73] RET, EXPR isnan_double(res) [L73] COND TRUE !isnan_double(res) [L74] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 456 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 311 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 145 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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-06 21:01:15,824 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/float-newlib/double_req_bl_1250.c -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 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 21:01:17,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 21:01:18,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 21:01:18,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 21:01:18,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 21:01:18,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 21:01:18,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 21:01:18,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 21:01:18,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 21:01:18,104 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 21:01:18,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 21:01:18,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 21:01:18,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 21:01:18,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 21:01:18,105 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 21:01:18,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 21:01:18,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 21:01:18,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 21:01:18,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 21:01:18,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 21:01:18,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 21:01:18,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 21:01:18,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 21:01:18,107 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 21:01:18,107 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 21:01:18,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 21:01:18,107 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 21:01:18,107 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 21:01:18,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 21:01:18,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 21:01:18,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 21:01:18,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 21:01:18,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 21:01:18,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 21:01:18,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:01:18,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 21:01:18,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 21:01:18,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 21:01:18,109 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 21:01:18,109 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 21:01:18,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 21:01:18,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 21:01:18,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 21:01:18,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 21:01:18,110 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 -> 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 [2024-11-06 21:01:18,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 21:01:18,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 21:01:18,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 21:01:18,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 21:01:18,415 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 21:01:18,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2024-11-06 21:01:19,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 21:01:20,006 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 21:01:20,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2024-11-06 21:01:20,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3ac82118/c1dd161f8efd4a77970dfb64f9605e41/FLAG799747347 [2024-11-06 21:01:20,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3ac82118/c1dd161f8efd4a77970dfb64f9605e41 [2024-11-06 21:01:20,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 21:01:20,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 21:01:20,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 21:01:20,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 21:01:20,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 21:01:20,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a71b033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20, skipping insertion in model container [2024-11-06 21:01:20,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 21:01:20,215 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/float-newlib/double_req_bl_1250.c[1965,1978] [2024-11-06 21:01:20,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:01:20,231 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 21:01:20,251 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/float-newlib/double_req_bl_1250.c[1965,1978] [2024-11-06 21:01:20,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:01:20,270 INFO L204 MainTranslator]: Completed translation [2024-11-06 21:01:20,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20 WrapperNode [2024-11-06 21:01:20,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 21:01:20,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 21:01:20,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 21:01:20,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 21:01:20,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,313 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-11-06 21:01:20,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 21:01:20,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 21:01:20,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 21:01:20,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 21:01:20,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,346 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-06 21:01:20,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 21:01:20,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 21:01:20,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 21:01:20,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 21:01:20,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (1/1) ... [2024-11-06 21:01:20,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:01:20,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 21:01:20,410 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-06 21:01:20,413 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-06 21:01:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 21:01:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-06 21:01:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-06 21:01:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 21:01:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 21:01:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 21:01:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-06 21:01:20,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-06 21:01:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-06 21:01:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-06 21:01:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 21:01:20,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 21:01:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 21:01:20,518 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 21:01:20,520 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 21:01:20,681 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-06 21:01:20,681 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 21:01:20,690 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 21:01:20,691 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 21:01:20,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:20 BoogieIcfgContainer [2024-11-06 21:01:20,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 21:01:20,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 21:01:20,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 21:01:20,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 21:01:20,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:01:20" (1/3) ... [2024-11-06 21:01:20,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25aab31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:01:20, skipping insertion in model container [2024-11-06 21:01:20,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:20" (2/3) ... [2024-11-06 21:01:20,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25aab31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:01:20, skipping insertion in model container [2024-11-06 21:01:20,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:20" (3/3) ... [2024-11-06 21:01:20,701 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2024-11-06 21:01:20,714 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 21:01:20,715 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 21:01:20,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 21:01:20,770 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;@62514efc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 21:01:20,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 21:01:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:01:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-06 21:01:20,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:20,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:20,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:20,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:20,789 INFO L85 PathProgramCache]: Analyzing trace with hash -137544036, now seen corresponding path program 1 times [2024-11-06 21:01:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:20,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962414943] [2024-11-06 21:01:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:20,799 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-06 21:01:20,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:20,801 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-06 21:01:20,802 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-06 21:01:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:20,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 21:01:20,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:01:20,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:20,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:20,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962414943] [2024-11-06 21:01:20,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962414943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:20,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:20,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 21:01:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733097744] [2024-11-06 21:01:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:20,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 21:01:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:20,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 21:01:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 21:01:20,943 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:20,956 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2024-11-06 21:01:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 21:01:20,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-06 21:01:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:20,963 INFO L225 Difference]: With dead ends: 43 [2024-11-06 21:01:20,963 INFO L226 Difference]: Without dead ends: 20 [2024-11-06 21:01:20,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-06 21:01:20,971 INFO L432 NwaCegarLoop]: 29 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, 29 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-06 21:01:20,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:20,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-06 21:01:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-06 21:01:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:01:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-06 21:01:21,003 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 13 [2024-11-06 21:01:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:21,004 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-06 21:01:21,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-11-06 21:01:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 21:01:21,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:21,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:21,014 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-06 21:01:21,207 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-06 21:01:21,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:21,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1479426789, now seen corresponding path program 1 times [2024-11-06 21:01:21,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:21,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054646530] [2024-11-06 21:01:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:21,209 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-06 21:01:21,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:21,211 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-06 21:01:21,215 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-06 21:01:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:21,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:21,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:01:21,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:21,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054646530] [2024-11-06 21:01:21,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054646530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:21,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:21,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:21,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686567069] [2024-11-06 21:01:21,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:21,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:21,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:21,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:21,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:21,356 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:21,556 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-11-06 21:01:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:21,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-06 21:01:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:21,559 INFO L225 Difference]: With dead ends: 28 [2024-11-06 21:01:21,559 INFO L226 Difference]: Without dead ends: 23 [2024-11-06 21:01:21,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:21,560 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:21,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 21:01:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-06 21:01:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-06 21:01:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-06 21:01:21,566 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2024-11-06 21:01:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:21,567 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-06 21:01:21,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-06 21:01:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 21:01:21,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:21,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:21,571 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-06 21:01:21,768 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-06 21:01:21,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:21,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash -208139495, now seen corresponding path program 1 times [2024-11-06 21:01:21,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:21,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002100047] [2024-11-06 21:01:21,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:21,769 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-06 21:01:21,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:21,771 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-06 21:01:21,773 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-06 21:01:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:21,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:21,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:01:21,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:21,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:21,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002100047] [2024-11-06 21:01:21,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002100047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:21,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:21,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12777442] [2024-11-06 21:01:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:21,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:21,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:21,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:21,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:21,878 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:22,038 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-06 21:01:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:22,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-06 21:01:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:22,039 INFO L225 Difference]: With dead ends: 31 [2024-11-06 21:01:22,039 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 21:01:22,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:22,040 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:22,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 21:01:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 21:01:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-06 21:01:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-06 21:01:22,045 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 15 [2024-11-06 21:01:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:22,045 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-06 21:01:22,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-06 21:01:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 21:01:22,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:22,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:22,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-06 21:01:22,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:01:22,248 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:22,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1693187297, now seen corresponding path program 1 times [2024-11-06 21:01:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:22,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108371906] [2024-11-06 21:01:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:22,249 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-06 21:01:22,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:22,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:01:22,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-06 21:01:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:22,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:22,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:01:22,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:22,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:22,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108371906] [2024-11-06 21:01:22,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108371906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:22,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:22,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:22,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850520178] [2024-11-06 21:01:22,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:22,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:22,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:22,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:22,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:22,353 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:22,513 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-06 21:01:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:22,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-06 21:01:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:22,514 INFO L225 Difference]: With dead ends: 31 [2024-11-06 21:01:22,514 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 21:01:22,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:22,515 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:22,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 21:01:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 21:01:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-06 21:01:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-06 21:01:22,520 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2024-11-06 21:01:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:22,520 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-06 21:01:22,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-06 21:01:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 21:01:22,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:22,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:22,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-06 21:01:22,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:01:22,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:22,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1113917547, now seen corresponding path program 1 times [2024-11-06 21:01:22,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:22,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689778705] [2024-11-06 21:01:22,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:22,726 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-06 21:01:22,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:22,728 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:01:22,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 21:01:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:22,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:22,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:01:22,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:22,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:22,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689778705] [2024-11-06 21:01:22,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689778705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:22,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:22,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:22,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636995834] [2024-11-06 21:01:22,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:22,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:22,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:22,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:22,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:22,832 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:22,907 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-06 21:01:22,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:22,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-06 21:01:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:22,908 INFO L225 Difference]: With dead ends: 31 [2024-11-06 21:01:22,908 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 21:01:22,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:22,909 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:22,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 21:01:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 21:01:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-06 21:01:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-06 21:01:22,913 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 17 [2024-11-06 21:01:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:22,913 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-06 21:01:22,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-06 21:01:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 21:01:22,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:22,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:22,918 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 (6)] Forceful destruction successful, exit code 0 [2024-11-06 21:01:23,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:01:23,115 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:23,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:23,115 INFO L85 PathProgramCache]: Analyzing trace with hash 628892788, now seen corresponding path program 1 times [2024-11-06 21:01:23,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:23,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94515479] [2024-11-06 21:01:23,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:23,116 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-06 21:01:23,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:23,118 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:01:23,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 21:01:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:23,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 21:01:23,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:01:23,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:23,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:23,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94515479] [2024-11-06 21:01:23,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94515479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:23,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:23,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 21:01:23,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426376538] [2024-11-06 21:01:23,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:23,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 21:01:23,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:23,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 21:01:23,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 21:01:23,329 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:23,420 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-11-06 21:01:23,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 21:01:23,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-06 21:01:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:23,421 INFO L225 Difference]: With dead ends: 28 [2024-11-06 21:01:23,421 INFO L226 Difference]: Without dead ends: 23 [2024-11-06 21:01:23,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 21:01:23,422 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:23,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 21:01:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-06 21:01:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-11-06 21:01:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:01:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-06 21:01:23,426 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2024-11-06 21:01:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:23,426 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-06 21:01:23,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:01:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-06 21:01:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-06 21:01:23,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:23,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:23,431 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 (7)] Forceful destruction successful, exit code 0 [2024-11-06 21:01:23,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:01:23,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:23,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:23,628 INFO L85 PathProgramCache]: Analyzing trace with hash 550124328, now seen corresponding path program 1 times [2024-11-06 21:01:23,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:23,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589035268] [2024-11-06 21:01:23,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:23,628 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-06 21:01:23,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:23,630 INFO L229 MonitoredProcess]: Starting monitored process 8 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-06 21:01:23,632 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 (8)] Waiting until timeout for monitored process [2024-11-06 21:01:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:23,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:23,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 21:01:23,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:23,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:23,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589035268] [2024-11-06 21:01:23,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589035268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:23,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:23,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:23,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211217049] [2024-11-06 21:01:23,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:23,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:23,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:23,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:23,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:23,726 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:01:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:24,059 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-06 21:01:24,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:24,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-06 21:01:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:24,061 INFO L225 Difference]: With dead ends: 28 [2024-11-06 21:01:24,061 INFO L226 Difference]: Without dead ends: 22 [2024-11-06 21:01:24,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:24,062 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:24,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 21:01:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-06 21:01:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-06 21:01:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 21:01:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-06 21:01:24,070 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 22 [2024-11-06 21:01:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:24,070 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-06 21:01:24,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:01:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-06 21:01:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 21:01:24,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:24,072 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:24,077 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 (8)] Ended with exit code 0 [2024-11-06 21:01:24,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-06 21:01:24,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:24,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:24,273 INFO L85 PathProgramCache]: Analyzing trace with hash -835727554, now seen corresponding path program 1 times [2024-11-06 21:01:24,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:24,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651113073] [2024-11-06 21:01:24,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:24,274 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-06 21:01:24,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:24,276 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:01:24,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-06 21:01:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:24,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:24,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 21:01:24,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:24,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:24,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651113073] [2024-11-06 21:01:24,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651113073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:24,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:24,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:24,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077078239] [2024-11-06 21:01:24,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:24,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:24,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:24,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:24,384 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:01:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:24,457 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-06 21:01:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:24,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-06 21:01:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:24,458 INFO L225 Difference]: With dead ends: 30 [2024-11-06 21:01:24,458 INFO L226 Difference]: Without dead ends: 24 [2024-11-06 21:01:24,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:24,459 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:24,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 21:01:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-06 21:01:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-06 21:01:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 21:01:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-06 21:01:24,462 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 23 [2024-11-06 21:01:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:24,463 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-06 21:01:24,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:01:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-06 21:01:24,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-06 21:01:24,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:24,464 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:24,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-06 21:01:24,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:01:24,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:24,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:24,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1828811108, now seen corresponding path program 1 times [2024-11-06 21:01:24,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:24,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192196149] [2024-11-06 21:01:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:24,665 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-06 21:01:24,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:24,667 INFO L229 MonitoredProcess]: Starting monitored process 10 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-06 21:01:24,668 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 (10)] Waiting until timeout for monitored process [2024-11-06 21:01:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:24,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:24,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 21:01:24,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:24,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:24,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192196149] [2024-11-06 21:01:24,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192196149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:24,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:24,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:24,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086258454] [2024-11-06 21:01:24,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:24,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:24,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:24,770 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:01:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:24,847 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-06 21:01:24,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:24,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-06 21:01:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:24,848 INFO L225 Difference]: With dead ends: 30 [2024-11-06 21:01:24,848 INFO L226 Difference]: Without dead ends: 24 [2024-11-06 21:01:24,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:24,849 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:24,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 21:01:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-06 21:01:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-06 21:01:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 21:01:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-06 21:01:24,852 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2024-11-06 21:01:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:24,852 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-06 21:01:24,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:01:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-06 21:01:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 21:01:24,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:24,853 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:24,858 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 (10)] Ended with exit code 0 [2024-11-06 21:01:25,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-06 21:01:25,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:25,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:25,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1206437754, now seen corresponding path program 1 times [2024-11-06 21:01:25,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:25,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138771983] [2024-11-06 21:01:25,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:25,055 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-06 21:01:25,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:25,056 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:01:25,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-06 21:01:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:25,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:25,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 21:01:25,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:25,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:25,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138771983] [2024-11-06 21:01:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138771983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:25,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592495856] [2024-11-06 21:01:25,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:25,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:25,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:25,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:25,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:25,164 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:01:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:25,256 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-06 21:01:25,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:25,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-06 21:01:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:25,257 INFO L225 Difference]: With dead ends: 30 [2024-11-06 21:01:25,257 INFO L226 Difference]: Without dead ends: 24 [2024-11-06 21:01:25,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:25,257 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:25,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 21:01:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-06 21:01:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-06 21:01:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 21:01:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-06 21:01:25,261 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 25 [2024-11-06 21:01:25,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:25,261 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-06 21:01:25,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:01:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-06 21:01:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 21:01:25,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:25,262 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:25,267 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 (11)] Ended with exit code 0 [2024-11-06 21:01:25,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-06 21:01:25,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:25,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:25,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1345719207, now seen corresponding path program 1 times [2024-11-06 21:01:25,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:25,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505717906] [2024-11-06 21:01:25,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:25,464 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-06 21:01:25,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:25,465 INFO L229 MonitoredProcess]: Starting monitored process 12 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-06 21:01:25,470 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 (12)] Waiting until timeout for monitored process [2024-11-06 21:01:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:25,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 21:01:25,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 21:01:25,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:25,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:25,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505717906] [2024-11-06 21:01:25,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505717906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:25,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:25,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 21:01:25,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341781051] [2024-11-06 21:01:25,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:25,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 21:01:25,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:25,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 21:01:25,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 21:01:25,651 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:01:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:25,699 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-06 21:01:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 21:01:25,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-06 21:01:25,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:25,700 INFO L225 Difference]: With dead ends: 22 [2024-11-06 21:01:25,700 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 21:01:25,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 21:01:25,701 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:25,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:25,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 21:01:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 21:01:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 21:01:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 21:01:25,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-11-06 21:01:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:25,702 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 21:01:25,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:01:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 21:01:25,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 21:01:25,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 21:01:25,711 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 (12)] Ended with exit code 0 [2024-11-06 21:01:25,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-06 21:01:25,908 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:25,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 21:01:25,957 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 21:01:25,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:01:25 BoogieIcfgContainer [2024-11-06 21:01:25,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 21:01:25,967 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 21:01:25,967 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 21:01:25,967 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 21:01:25,968 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:20" (3/4) ... [2024-11-06 21:01:25,969 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 21:01:25,974 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2024-11-06 21:01:25,976 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-06 21:01:25,976 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-06 21:01:25,976 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 21:01:25,977 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 21:01:26,031 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 21:01:26,032 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 21:01:26,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 21:01:26,032 INFO L158 Benchmark]: Toolchain (without parser) took 5993.86ms. Allocated memory is still 83.9MB. Free memory was 60.4MB in the beginning and 41.3MB in the end (delta: 19.1MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:26,033 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:01:26,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.35ms. Allocated memory is still 83.9MB. Free memory was 60.4MB in the beginning and 48.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:26,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.19ms. Allocated memory is still 83.9MB. Free memory was 48.5MB in the beginning and 47.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:01:26,033 INFO L158 Benchmark]: Boogie Preprocessor took 57.80ms. Allocated memory is still 83.9MB. Free memory was 47.1MB in the beginning and 45.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:26,034 INFO L158 Benchmark]: RCFGBuilder took 318.81ms. Allocated memory is still 83.9MB. Free memory was 45.3MB in the beginning and 33.2MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:26,034 INFO L158 Benchmark]: TraceAbstraction took 5272.02ms. Allocated memory is still 83.9MB. Free memory was 32.5MB in the beginning and 45.7MB in the end (delta: -13.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:01:26,034 INFO L158 Benchmark]: Witness Printer took 65.10ms. Allocated memory is still 83.9MB. Free memory was 45.7MB in the beginning and 41.3MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:26,035 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.32ms. Allocated memory is still 83.9MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.35ms. Allocated memory is still 83.9MB. Free memory was 60.4MB in the beginning and 48.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.19ms. Allocated memory is still 83.9MB. Free memory was 48.5MB in the beginning and 47.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.80ms. Allocated memory is still 83.9MB. Free memory was 47.1MB in the beginning and 45.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 318.81ms. Allocated memory is still 83.9MB. Free memory was 45.3MB in the beginning and 33.2MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5272.02ms. Allocated memory is still 83.9MB. Free memory was 32.5MB in the beginning and 45.7MB in the end (delta: -13.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 65.10ms. Allocated memory is still 83.9MB. Free memory was 45.7MB in the beginning and 41.3MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 74]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 787 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 285 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 200 ConstructedInterpolants, 8 QuantifiedInterpolants, 304 SizeOfPredicates, 2 NumberOfNonLiveVariables, 769 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 30/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-06 21:01:26,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE