./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'b82c9a8499c502d0bd74801770530955769ac9e616506e7cf0d04286124c996f'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b82c9a8499c502d0bd74801770530955769ac9e616506e7cf0d04286124c996f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:57:43,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:57:43,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:57:43,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:57:43,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:57:43,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:57:43,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:57:43,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:57:43,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:57:43,921 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:57:43,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:57:43,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:57:43,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:57:43,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:57:43,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:57:43,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:57:43,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:57:43,925 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:57:43,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:57:43,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:57:43,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:57:43,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:57:43,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:57:43,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:57:43,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:57:43,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:57:43,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:57:43,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:57:43,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:57:43,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:57:43,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:57:43,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:57:43,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:57:43,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:57:43,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:57:43,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:57:43,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:57:43,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:57:43,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:57:43,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:57:43,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:57:43,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:57:43,926 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 -> b82c9a8499c502d0bd74801770530955769ac9e616506e7cf0d04286124c996f [2024-11-07 08:57:44,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:57:44,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:57:44,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:57:44,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:57:44,207 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:57:44,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i [2024-11-07 08:57:45,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:57:45,892 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:57:45,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i [2024-11-07 08:57:45,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/beb1e03cb/f39821e66b2e423a94676387d49a2946/FLAGa66e7fb10 [2024-11-07 08:57:45,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/beb1e03cb/f39821e66b2e423a94676387d49a2946 [2024-11-07 08:57:45,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:57:45,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:57:45,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:57:45,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:57:45,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:57:45,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:57:45" (1/1) ... [2024-11-07 08:57:45,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc5a444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:45, skipping insertion in model container [2024-11-07 08:57:45,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:57:45" (1/1) ... [2024-11-07 08:57:45,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:57:46,098 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i[915,928] [2024-11-07 08:57:46,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:57:46,174 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:57:46,185 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i[915,928] [2024-11-07 08:57:46,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:57:46,233 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:57:46,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46 WrapperNode [2024-11-07 08:57:46,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:57:46,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:57:46,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:57:46,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:57:46,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (1/1) ... [2024-11-07 08:57:46,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (1/1) ... [2024-11-07 08:57:46,283 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-07 08:57:46,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:57:46,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:57:46,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:57:46,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:57:46,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (1/1) ... [2024-11-07 08:57:46,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (1/1) ... [2024-11-07 08:57:46,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (1/1) ... [2024-11-07 08:57:46,318 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:57:46,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (1/1) ... [2024-11-07 08:57:46,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (1/1) ... [2024-11-07 08:57:46,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (1/1) ... [2024-11-07 08:57:46,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (1/1) ... [2024-11-07 08:57:46,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (1/1) ... [2024-11-07 08:57:46,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (1/1) ... [2024-11-07 08:57:46,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:57:46,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:57:46,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:57:46,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:57:46,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (1/1) ... [2024-11-07 08:57:46,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:57:46,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:57:46,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:57:46,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:57:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:57:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:57:46,405 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:57:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:57:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:57:46,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:57:46,492 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:57:46,495 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:57:46,853 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-07 08:57:46,854 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:57:46,867 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:57:46,867 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:57:46,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:57:46 BoogieIcfgContainer [2024-11-07 08:57:46,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:57:46,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:57:46,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:57:46,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:57:46,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:57:45" (1/3) ... [2024-11-07 08:57:46,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432cbac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:57:46, skipping insertion in model container [2024-11-07 08:57:46,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:57:46" (2/3) ... [2024-11-07 08:57:46,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432cbac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:57:46, skipping insertion in model container [2024-11-07 08:57:46,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:57:46" (3/3) ... [2024-11-07 08:57:46,879 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-74.i [2024-11-07 08:57:46,892 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:57:46,894 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:57:46,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:57:46,989 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;@4ee06060, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:57:46,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:57:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 54 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:57:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 08:57:47,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:57:47,011 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:57:47,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:57:47,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:57:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash 247637528, now seen corresponding path program 1 times [2024-11-07 08:57:47,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:57:47,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020228112] [2024-11-07 08:57:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:47,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:57:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:57:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:57:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:57:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:57:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:57:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:57:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:57:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:57:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:57:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:57:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:57:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:57:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:57:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:57:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:57:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:57:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:57:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:57:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:57:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:57:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:57:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:57:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:57:47,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:57:47,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020228112] [2024-11-07 08:57:47,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020228112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:57:47,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:57:47,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:57:47,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813190132] [2024-11-07 08:57:47,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:57:47,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:57:47,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:57:47,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:57:47,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:57:47,656 INFO L87 Difference]: Start difference. First operand has 78 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 54 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:57:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:57:47,735 INFO L93 Difference]: Finished difference Result 182 states and 306 transitions. [2024-11-07 08:57:47,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:57:47,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-07 08:57:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:57:47,744 INFO L225 Difference]: With dead ends: 182 [2024-11-07 08:57:47,745 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 08:57:47,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:57:47,750 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 46 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:57:47,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 199 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:57:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 08:57:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-11-07 08:57:47,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.267605633802817) internal successors, (90), 72 states have internal predecessors, (90), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 08:57:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2024-11-07 08:57:47,803 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 145 [2024-11-07 08:57:47,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:57:47,804 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2024-11-07 08:57:47,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:57:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2024-11-07 08:57:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 08:57:47,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:57:47,811 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:57:47,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:57:47,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:57:47,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:57:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash 927695898, now seen corresponding path program 1 times [2024-11-07 08:57:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:57:47,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635093878] [2024-11-07 08:57:47,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:47,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:57:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:57:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:57:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:57:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:57:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:57:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:57:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:57:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:57:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:57:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:57:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:57:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:57:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:57:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:57:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:57:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:57:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:57:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:57:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:57:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:57:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:57:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:57:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:57:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:57:48,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635093878] [2024-11-07 08:57:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635093878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:57:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:57:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:57:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330426090] [2024-11-07 08:57:48,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:57:48,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:57:48,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:57:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:57:48,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:57:48,879 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:57:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:57:49,287 INFO L93 Difference]: Finished difference Result 295 states and 425 transitions. [2024-11-07 08:57:49,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:57:49,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-07 08:57:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:57:49,291 INFO L225 Difference]: With dead ends: 295 [2024-11-07 08:57:49,294 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 08:57:49,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:57:49,298 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 75 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:57:49,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 342 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:57:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 08:57:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 151. [2024-11-07 08:57:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 94 states have (on average 1.202127659574468) internal successors, (113), 95 states have internal predecessors, (113), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 08:57:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 217 transitions. [2024-11-07 08:57:49,360 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 217 transitions. Word has length 145 [2024-11-07 08:57:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:57:49,361 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 217 transitions. [2024-11-07 08:57:49,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:57:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 217 transitions. [2024-11-07 08:57:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 08:57:49,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:57:49,366 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:57:49,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:57:49,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:57:49,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:57:49,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1299593130, now seen corresponding path program 1 times [2024-11-07 08:57:49,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:57:49,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83873788] [2024-11-07 08:57:49,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:49,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:57:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:57:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:57:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:57:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:57:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:57:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:57:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:57:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:57:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:57:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:57:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:57:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:57:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:57:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:57:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:57:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:57:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:57:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:57:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:57:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:57:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:57:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:57:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:57:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:57:49,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83873788] [2024-11-07 08:57:49,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83873788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:57:49,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:57:49,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:57:49,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233128593] [2024-11-07 08:57:49,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:57:49,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:57:49,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:57:49,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:57:49,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:57:49,964 INFO L87 Difference]: Start difference. First operand 151 states and 217 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:57:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:57:50,258 INFO L93 Difference]: Finished difference Result 295 states and 424 transitions. [2024-11-07 08:57:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:57:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-07 08:57:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:57:50,263 INFO L225 Difference]: With dead ends: 295 [2024-11-07 08:57:50,263 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 08:57:50,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:57:50,268 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 73 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:57:50,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 343 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:57:50,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 08:57:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 152. [2024-11-07 08:57:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 95 states have (on average 1.2) internal successors, (114), 96 states have internal predecessors, (114), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 08:57:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 218 transitions. [2024-11-07 08:57:50,306 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 218 transitions. Word has length 146 [2024-11-07 08:57:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:57:50,307 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 218 transitions. [2024-11-07 08:57:50,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:57:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 218 transitions. [2024-11-07 08:57:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 08:57:50,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:57:50,309 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:57:50,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:57:50,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:57:50,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:57:50,310 INFO L85 PathProgramCache]: Analyzing trace with hash 278524776, now seen corresponding path program 1 times [2024-11-07 08:57:50,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:57:50,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131386406] [2024-11-07 08:57:50,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:50,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:57:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:57:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:57:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:57:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:57:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:57:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:57:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:57:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:57:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:57:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:57:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:57:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:57:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:57:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:57:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:57:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:57:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:57:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:57:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:57:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:57:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:57:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:57:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:57:50,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:57:50,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131386406] [2024-11-07 08:57:50,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131386406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:57:50,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:57:50,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:57:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022580618] [2024-11-07 08:57:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:57:50,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:57:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:57:50,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:57:50,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:57:50,842 INFO L87 Difference]: Start difference. First operand 152 states and 218 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:57:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:57:51,069 INFO L93 Difference]: Finished difference Result 260 states and 376 transitions. [2024-11-07 08:57:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:57:51,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-07 08:57:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:57:51,074 INFO L225 Difference]: With dead ends: 260 [2024-11-07 08:57:51,074 INFO L226 Difference]: Without dead ends: 159 [2024-11-07 08:57:51,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:57:51,075 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 94 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:57:51,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 358 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:57:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-07 08:57:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2024-11-07 08:57:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 96 states have internal predecessors, (112), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 08:57:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2024-11-07 08:57:51,114 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 146 [2024-11-07 08:57:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:57:51,114 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2024-11-07 08:57:51,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:57:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2024-11-07 08:57:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 08:57:51,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:57:51,116 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:57:51,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:57:51,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:57:51,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:57:51,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1005788103, now seen corresponding path program 1 times [2024-11-07 08:57:51,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:57:51,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392724136] [2024-11-07 08:57:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:51,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:57:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:57:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:57:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:57:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:57:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:57:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:57:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:57:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:57:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:57:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:57:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:57:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:57:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:57:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:57:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:57:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:57:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:57:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:57:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:57:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:57:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:57:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:57:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-07 08:57:51,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:57:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392724136] [2024-11-07 08:57:51,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392724136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:57:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773680246] [2024-11-07 08:57:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:51,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:57:51,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:57:51,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:57:51,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:57:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:57:52,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 08:57:52,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:57:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 562 proven. 54 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-07 08:57:52,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:57:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 66 proven. 57 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-11-07 08:57:53,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773680246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:57:53,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:57:53,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 27 [2024-11-07 08:57:53,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919203819] [2024-11-07 08:57:53,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:57:53,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 08:57:53,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:57:53,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 08:57:53,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2024-11-07 08:57:53,673 INFO L87 Difference]: Start difference. First operand 152 states and 216 transitions. Second operand has 27 states, 27 states have (on average 3.6666666666666665) internal successors, (99), 27 states have internal predecessors, (99), 6 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (45), 6 states have call predecessors, (45), 6 states have call successors, (45) [2024-11-07 08:57:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:57:55,772 INFO L93 Difference]: Finished difference Result 570 states and 770 transitions. [2024-11-07 08:57:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-07 08:57:55,773 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.6666666666666665) internal successors, (99), 27 states have internal predecessors, (99), 6 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (45), 6 states have call predecessors, (45), 6 states have call successors, (45) Word has length 148 [2024-11-07 08:57:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:57:55,778 INFO L225 Difference]: With dead ends: 570 [2024-11-07 08:57:55,778 INFO L226 Difference]: Without dead ends: 469 [2024-11-07 08:57:55,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=917, Invalid=2163, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 08:57:55,783 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 818 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:57:55,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 646 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 08:57:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-07 08:57:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 260. [2024-11-07 08:57:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 177 states have (on average 1.1977401129943503) internal successors, (212), 180 states have internal predecessors, (212), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 08:57:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 352 transitions. [2024-11-07 08:57:55,851 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 352 transitions. Word has length 148 [2024-11-07 08:57:55,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:57:55,852 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 352 transitions. [2024-11-07 08:57:55,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.6666666666666665) internal successors, (99), 27 states have internal predecessors, (99), 6 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (45), 6 states have call predecessors, (45), 6 states have call successors, (45) [2024-11-07 08:57:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 352 transitions. [2024-11-07 08:57:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 08:57:55,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:57:55,854 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:57:55,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:57:56,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:57:56,059 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:57:56,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:57:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash -325729733, now seen corresponding path program 1 times [2024-11-07 08:57:56,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:57:56,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716492582] [2024-11-07 08:57:56,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:56,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:57:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:57:56,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744022819] [2024-11-07 08:57:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:57:56,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:57:56,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:57:56,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:57:56,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 08:57:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:57:56,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:57:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:57:56,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:57:56,463 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:57:56,464 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:57:56,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 08:57:56,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:57:56,669 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 08:57:56,790 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:57:56,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:57:56 BoogieIcfgContainer [2024-11-07 08:57:56,793 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:57:56,794 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:57:56,794 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:57:56,794 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:57:56,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:57:46" (3/4) ... [2024-11-07 08:57:56,796 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:57:56,797 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:57:56,798 INFO L158 Benchmark]: Toolchain (without parser) took 10870.56ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 91.2MB in the beginning and 122.8MB in the end (delta: -31.6MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2024-11-07 08:57:56,798 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 81.6MB in the end (delta: 82.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:57:56,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.63ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 77.2MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:57:56,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.54ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 74.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:57:56,799 INFO L158 Benchmark]: Boogie Preprocessor took 49.95ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 71.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:57:56,799 INFO L158 Benchmark]: RCFGBuilder took 527.62ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 50.5MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 08:57:56,800 INFO L158 Benchmark]: TraceAbstraction took 9921.47ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 50.0MB in the beginning and 122.8MB in the end (delta: -72.9MB). Peak memory consumption was 24.2kB. Max. memory is 16.1GB. [2024-11-07 08:57:56,800 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 192.9MB. Free memory was 122.8MB in the beginning and 122.8MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:57:56,801 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.43ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 81.6MB in the end (delta: 82.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.63ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 77.2MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.54ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 74.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.95ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 71.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 527.62ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 50.5MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9921.47ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 50.0MB in the beginning and 122.8MB in the end (delta: -72.9MB). Peak memory consumption was 24.2kB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 192.9MB. Free memory was 122.8MB in the beginning and 122.8MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryArithmeticFLOAToperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] unsigned long int last_1_var_1_1 = 64; [L43] unsigned char last_1_var_1_11 = 50; VAL [isInitial=0, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] CALL updateLastVariables() [L132] last_1_var_1_1 = var_1_1 [L133] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L143] RET updateLastVariables() [L144] CALL updateVariables() [L94] var_1_4 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L97] var_1_5 = __VERIFIER_nondet_ulong() [L98] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L100] var_1_7 = __VERIFIER_nondet_ulong() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L103] var_1_9 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L104] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L105] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L106] var_1_10 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L107] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L109] var_1_12 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L112] var_1_13 = __VERIFIER_nondet_long() [L113] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L114] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L115] var_1_16 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L116] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L117] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L118] var_1_17 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L119] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L120] var_1_19 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L122] var_1_20 = __VERIFIER_nondet_float() [L123] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L123] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L124] var_1_21 = __VERIFIER_nondet_float() [L125] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L125] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L126] var_1_22 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L128] var_1_23 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L129] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L144] RET updateVariables() [L145] CALL step() [L47] signed long int stepLocal_1 = last_1_var_1_11; [L48] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L49] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L50] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L54] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L55] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L55] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L56] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L67] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L69] COND FALSE !(! (var_1_11 >= var_1_11)) [L76] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L78] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L83] COND FALSE !(\read(var_1_10)) [L86] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L88] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L89] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136-L137] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1107 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1106 mSDsluCounter, 1888 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1329 mSDsCounter, 410 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1399 IncrementalHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 410 mSolverCounterUnsat, 559 mSDtfsCounter, 1399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 585 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=5, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 304 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1174 NumberOfCodeBlocks, 1174 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1019 ConstructedInterpolants, 0 QuantifiedInterpolants, 3773 SizeOfPredicates, 4 NumberOfNonLiveVariables, 335 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6324/6468 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 08:57:56,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b82c9a8499c502d0bd74801770530955769ac9e616506e7cf0d04286124c996f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:57:59,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:57:59,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:57:59,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:57:59,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:57:59,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:57:59,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:57:59,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:57:59,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:57:59,150 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:57:59,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:57:59,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:57:59,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:57:59,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:57:59,151 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:57:59,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:57:59,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:57:59,151 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:57:59,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:57:59,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:57:59,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:57:59,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:57:59,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:57:59,152 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:57:59,152 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:57:59,152 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:57:59,152 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:57:59,152 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:57:59,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:57:59,152 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:57:59,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:57:59,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:57:59,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:57:59,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:57:59,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:57:59,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:57:59,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:57:59,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:57:59,153 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:57:59,153 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:57:59,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:57:59,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:57:59,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:57:59,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:57:59,154 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 -> b82c9a8499c502d0bd74801770530955769ac9e616506e7cf0d04286124c996f [2024-11-07 08:57:59,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:57:59,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:57:59,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:57:59,605 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:57:59,605 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:57:59,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i [2024-11-07 08:58:01,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:58:01,298 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:58:01,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i [2024-11-07 08:58:01,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f47a3bd8d/07472d76104044558396ac9887abb5d8/FLAG218d9c70d [2024-11-07 08:58:01,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f47a3bd8d/07472d76104044558396ac9887abb5d8 [2024-11-07 08:58:01,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:58:01,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:58:01,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:58:01,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:58:01,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:58:01,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d16fef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01, skipping insertion in model container [2024-11-07 08:58:01,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:58:01,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i[915,928] [2024-11-07 08:58:01,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:58:01,605 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:58:01,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i[915,928] [2024-11-07 08:58:01,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:58:01,674 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:58:01,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01 WrapperNode [2024-11-07 08:58:01,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:58:01,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:58:01,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:58:01,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:58:01,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,733 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-11-07 08:58:01,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:58:01,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:58:01,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:58:01,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:58:01,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,763 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:58:01,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:58:01,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:58:01,784 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:58:01,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:58:01,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (1/1) ... [2024-11-07 08:58:01,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:58:01,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:58:01,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:58:01,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:58:01,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:58:01,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:58:01,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:58:01,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:58:01,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:58:01,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:58:01,914 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:58:01,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:58:03,625 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 08:58:03,626 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:58:03,639 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:58:03,639 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:58:03,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:58:03 BoogieIcfgContainer [2024-11-07 08:58:03,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:58:03,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:58:03,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:58:03,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:58:03,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:58:01" (1/3) ... [2024-11-07 08:58:03,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284646e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:58:03, skipping insertion in model container [2024-11-07 08:58:03,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:01" (2/3) ... [2024-11-07 08:58:03,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284646e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:58:03, skipping insertion in model container [2024-11-07 08:58:03,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:58:03" (3/3) ... [2024-11-07 08:58:03,651 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-74.i [2024-11-07 08:58:03,685 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:58:03,685 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:58:03,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:58:03,760 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;@544909ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:58:03,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:58:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:58:03,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 08:58:03,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:58:03,780 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:58:03,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:58:03,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:58:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash 709615713, now seen corresponding path program 1 times [2024-11-07 08:58:03,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:58:03,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417651392] [2024-11-07 08:58:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:58:03,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:58:03,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:58:03,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:58:03,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 08:58:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:58:04,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:58:04,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:58:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-07 08:58:04,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:58:04,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:58:04,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417651392] [2024-11-07 08:58:04,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417651392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:58:04,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:58:04,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:58:04,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081164178] [2024-11-07 08:58:04,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:58:04,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:58:04,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:58:04,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:58:04,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:58:04,247 INFO L87 Difference]: Start difference. First operand has 68 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 08:58:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:58:04,266 INFO L93 Difference]: Finished difference Result 128 states and 220 transitions. [2024-11-07 08:58:04,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:58:04,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2024-11-07 08:58:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:58:04,273 INFO L225 Difference]: With dead ends: 128 [2024-11-07 08:58:04,273 INFO L226 Difference]: Without dead ends: 63 [2024-11-07 08:58:04,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:58:04,277 INFO L432 NwaCegarLoop]: 93 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, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:58:04,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:58:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-07 08:58:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-07 08:58:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:58:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2024-11-07 08:58:04,312 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 141 [2024-11-07 08:58:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:58:04,312 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2024-11-07 08:58:04,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 08:58:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2024-11-07 08:58:04,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 08:58:04,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:58:04,315 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:58:04,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 08:58:04,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:58:04,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:58:04,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:58:04,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1653291691, now seen corresponding path program 1 times [2024-11-07 08:58:04,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:58:04,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433015341] [2024-11-07 08:58:04,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:58:04,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:58:04,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:58:04,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:58:04,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:58:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:58:04,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 08:58:04,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:58:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:58:06,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:58:06,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:58:06,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433015341] [2024-11-07 08:58:06,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433015341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:58:06,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:58:06,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:58:06,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833113582] [2024-11-07 08:58:06,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:58:06,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:58:06,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:58:06,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:58:06,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:58:06,172 INFO L87 Difference]: Start difference. First operand 63 states and 93 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:58:09,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:58:11,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:58:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:58:11,304 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2024-11-07 08:58:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:58:11,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-11-07 08:58:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:58:11,330 INFO L225 Difference]: With dead ends: 184 [2024-11-07 08:58:11,331 INFO L226 Difference]: Without dead ends: 124 [2024-11-07 08:58:11,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:58:11,332 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 54 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:58:11,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 289 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-07 08:58:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-07 08:58:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2024-11-07 08:58:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 08:58:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2024-11-07 08:58:11,356 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 141 [2024-11-07 08:58:11,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:58:11,357 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 157 transitions. [2024-11-07 08:58:11,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:58:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 157 transitions. [2024-11-07 08:58:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 08:58:11,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:58:11,359 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:58:11,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:58:11,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:58:11,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:58:11,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:58:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1055812605, now seen corresponding path program 1 times [2024-11-07 08:58:11,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:58:11,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803118357] [2024-11-07 08:58:11,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:58:11,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:58:11,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:58:11,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:58:11,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:58:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:58:11,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 08:58:11,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:58:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:58:13,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:58:13,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:58:13,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803118357] [2024-11-07 08:58:13,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803118357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:58:13,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:58:13,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:58:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557038210] [2024-11-07 08:58:13,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:58:13,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:58:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:58:13,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:58:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:58:13,024 INFO L87 Difference]: Start difference. First operand 106 states and 157 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:58:14,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:58:16,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:58:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:58:16,495 INFO L93 Difference]: Finished difference Result 184 states and 273 transitions. [2024-11-07 08:58:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:58:16,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-11-07 08:58:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:58:16,524 INFO L225 Difference]: With dead ends: 184 [2024-11-07 08:58:16,524 INFO L226 Difference]: Without dead ends: 124 [2024-11-07 08:58:16,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:58:16,525 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 52 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:58:16,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 290 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-07 08:58:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-07 08:58:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2024-11-07 08:58:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 60 states have internal predecessors, (70), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 08:58:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 158 transitions. [2024-11-07 08:58:16,550 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 158 transitions. Word has length 142 [2024-11-07 08:58:16,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:58:16,550 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 158 transitions. [2024-11-07 08:58:16,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:58:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 158 transitions. [2024-11-07 08:58:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 08:58:16,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:58:16,557 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:58:16,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 08:58:16,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:58:16,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:58:16,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:58:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1313978043, now seen corresponding path program 1 times [2024-11-07 08:58:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:58:16,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702603261] [2024-11-07 08:58:16,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:58:16,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:58:16,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:58:16,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:58:16,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 08:58:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:58:17,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 08:58:17,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:58:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-07 08:58:17,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:58:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-07 08:58:18,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:58:18,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702603261] [2024-11-07 08:58:18,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702603261] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:58:18,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:58:18,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-07 08:58:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724533599] [2024-11-07 08:58:18,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:58:18,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 08:58:18,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:58:18,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 08:58:18,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:58:18,675 INFO L87 Difference]: Start difference. First operand 107 states and 158 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-07 08:58:22,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:58:23,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:58:25,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:58:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:58:26,452 INFO L93 Difference]: Finished difference Result 222 states and 312 transitions. [2024-11-07 08:58:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 08:58:26,454 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 142 [2024-11-07 08:58:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:58:26,456 INFO L225 Difference]: With dead ends: 222 [2024-11-07 08:58:26,457 INFO L226 Difference]: Without dead ends: 162 [2024-11-07 08:58:26,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2024-11-07 08:58:26,460 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 147 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:58:26,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 301 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-07 08:58:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-07 08:58:26,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2024-11-07 08:58:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 92 states have internal predecessors, (104), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 08:58:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 212 transitions. [2024-11-07 08:58:26,484 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 212 transitions. Word has length 142 [2024-11-07 08:58:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:58:26,486 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 212 transitions. [2024-11-07 08:58:26,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-07 08:58:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 212 transitions. [2024-11-07 08:58:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 08:58:26,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:58:26,490 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:58:26,507 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 (5)] Ended with exit code 0 [2024-11-07 08:58:26,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:58:26,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:58:26,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:58:26,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1315825085, now seen corresponding path program 1 times [2024-11-07 08:58:26,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:58:26,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042646244] [2024-11-07 08:58:26,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:58:26,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:58:26,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:58:26,693 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:58:26,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 08:58:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:58:27,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 08:58:27,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:59:08,650 WARN L286 SmtUtils]: Spent 14.19s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)