./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.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_fillercode_fillercodestructure_filler-pr-ci_file-20.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', 'f8764d0703f262f882fea925b2e1c51288e3d3f7182d2157f47a63a3f8cbf94f'] 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_fillercode_fillercodestructure_filler-pr-ci_file-20.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 f8764d0703f262f882fea925b2e1c51288e3d3f7182d2157f47a63a3f8cbf94f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:16:47,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:16:47,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:16:47,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:16:47,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:16:47,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:16:47,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:16:47,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:16:47,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:16:47,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:16:47,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:16:47,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:16:47,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:16:47,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:16:47,990 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:16:47,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:16:47,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:16:47,991 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:16:47,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:16:47,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:16:47,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:16:47,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:16:47,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:16:47,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:16:47,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:16:47,994 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:16:47,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:16:47,994 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:16:47,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:16:47,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:16:47,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:16:47,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:16:47,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:47,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:16:47,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:16:47,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:16:47,995 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:16:47,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:16:47,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:16:47,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:16:47,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:16:47,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:16:47,996 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 -> f8764d0703f262f882fea925b2e1c51288e3d3f7182d2157f47a63a3f8cbf94f [2024-11-07 06:16:48,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:16:48,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:16:48,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:16:48,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:16:48,334 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:16:48,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i [2024-11-07 06:16:49,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:16:49,917 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:16:49,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i [2024-11-07 06:16:49,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9d574d5e/2f608c85eccf4dfda92583d3f34674c5/FLAG8109fdf76 [2024-11-07 06:16:49,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9d574d5e/2f608c85eccf4dfda92583d3f34674c5 [2024-11-07 06:16:49,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:16:49,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:16:49,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:16:49,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:16:49,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:16:49,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:16:49" (1/1) ... [2024-11-07 06:16:49,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137823e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:49, skipping insertion in model container [2024-11-07 06:16:49,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:16:49" (1/1) ... [2024-11-07 06:16:49,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:16:50,093 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_fillercode_fillercodestructure_filler-pr-ci_file-20.i[919,932] [2024-11-07 06:16:50,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:16:50,206 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:16:50,214 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_fillercode_fillercodestructure_filler-pr-ci_file-20.i[919,932] [2024-11-07 06:16:50,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:16:50,265 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:16:50,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50 WrapperNode [2024-11-07 06:16:50,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:16:50,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:16:50,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:16:50,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:16:50,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (1/1) ... [2024-11-07 06:16:50,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (1/1) ... [2024-11-07 06:16:50,332 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-07 06:16:50,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:16:50,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:16:50,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:16:50,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:16:50,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (1/1) ... [2024-11-07 06:16:50,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (1/1) ... [2024-11-07 06:16:50,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (1/1) ... [2024-11-07 06:16:50,386 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 06:16:50,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (1/1) ... [2024-11-07 06:16:50,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (1/1) ... [2024-11-07 06:16:50,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (1/1) ... [2024-11-07 06:16:50,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (1/1) ... [2024-11-07 06:16:50,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (1/1) ... [2024-11-07 06:16:50,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (1/1) ... [2024-11-07 06:16:50,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:16:50,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:16:50,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:16:50,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:16:50,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (1/1) ... [2024-11-07 06:16:50,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:50,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:50,470 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 06:16:50,474 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 06:16:50,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:16:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:16:50,497 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:16:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:16:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:16:50,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:16:50,597 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:16:50,600 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:16:51,097 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-07 06:16:51,097 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:16:51,108 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:16:51,109 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:16:51,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:51 BoogieIcfgContainer [2024-11-07 06:16:51,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:16:51,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:16:51,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:16:51,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:16:51,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:16:49" (1/3) ... [2024-11-07 06:16:51,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588a58fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:16:51, skipping insertion in model container [2024-11-07 06:16:51,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:50" (2/3) ... [2024-11-07 06:16:51,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588a58fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:16:51, skipping insertion in model container [2024-11-07 06:16:51,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:51" (3/3) ... [2024-11-07 06:16:51,119 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i [2024-11-07 06:16:51,132 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:16:51,132 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:16:51,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:16:51,197 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;@3f80baf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:16:51,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:16:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 06:16:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 06:16:51,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:51,211 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:51,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:51,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1809289617, now seen corresponding path program 1 times [2024-11-07 06:16:51,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:51,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313340633] [2024-11-07 06:16:51,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:51,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:16:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:16:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:16:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:16:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:16:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 06:16:51,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:51,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313340633] [2024-11-07 06:16:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313340633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:51,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:16:51,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142383120] [2024-11-07 06:16:51,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:51,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:16:51,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:51,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:16:51,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:16:51,682 INFO L87 Difference]: Start difference. First operand has 86 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 06:16:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:51,709 INFO L93 Difference]: Finished difference Result 165 states and 279 transitions. [2024-11-07 06:16:51,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:16:51,714 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 144 [2024-11-07 06:16:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:51,721 INFO L225 Difference]: With dead ends: 165 [2024-11-07 06:16:51,722 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 06:16:51,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 06:16:51,731 INFO L432 NwaCegarLoop]: 125 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, 125 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 06:16:51,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:16:51,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 06:16:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 06:16:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 06:16:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-11-07 06:16:51,788 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 144 [2024-11-07 06:16:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:51,790 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-11-07 06:16:51,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 06:16:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-11-07 06:16:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 06:16:51,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:51,795 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:51,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:16:51,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:51,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1441247221, now seen corresponding path program 1 times [2024-11-07 06:16:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:51,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718119969] [2024-11-07 06:16:51,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:51,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:16:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:16:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:16:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:16:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:16:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 06:16:52,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718119969] [2024-11-07 06:16:52,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718119969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:52,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:52,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:16:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599190158] [2024-11-07 06:16:52,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:52,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:16:52,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:52,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:16:52,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:16:52,182 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 06:16:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:52,294 INFO L93 Difference]: Finished difference Result 198 states and 303 transitions. [2024-11-07 06:16:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:16:52,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-07 06:16:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:52,298 INFO L225 Difference]: With dead ends: 198 [2024-11-07 06:16:52,298 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 06:16:52,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 06:16:52,299 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 47 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:52,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 219 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:16:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 06:16:52,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2024-11-07 06:16:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 06:16:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2024-11-07 06:16:52,321 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 144 [2024-11-07 06:16:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:52,323 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-11-07 06:16:52,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 06:16:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2024-11-07 06:16:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 06:16:52,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:52,327 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:52,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:16:52,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:52,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:52,327 INFO L85 PathProgramCache]: Analyzing trace with hash -102117299, now seen corresponding path program 1 times [2024-11-07 06:16:52,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:52,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301903834] [2024-11-07 06:16:52,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:52,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:16:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:16:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:16:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:16:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:16:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 06:16:52,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:52,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301903834] [2024-11-07 06:16:52,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301903834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:52,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:52,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:16:52,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124516995] [2024-11-07 06:16:52,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:52,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:16:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:52,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:16:52,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:16:52,603 INFO L87 Difference]: Start difference. First operand 101 states and 153 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 06:16:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:52,701 INFO L93 Difference]: Finished difference Result 217 states and 325 transitions. [2024-11-07 06:16:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:16:52,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2024-11-07 06:16:52,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:52,704 INFO L225 Difference]: With dead ends: 217 [2024-11-07 06:16:52,704 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 06:16:52,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 06:16:52,707 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 51 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:52,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 223 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:16:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 06:16:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2024-11-07 06:16:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 06:16:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2024-11-07 06:16:52,718 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 145 [2024-11-07 06:16:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:52,719 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2024-11-07 06:16:52,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 06:16:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2024-11-07 06:16:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 06:16:52,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:52,722 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:52,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:16:52,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:52,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash 184355738, now seen corresponding path program 1 times [2024-11-07 06:16:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:52,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311724901] [2024-11-07 06:16:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:52,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:16:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:16:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:16:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:16:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:16:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-07 06:16:53,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:53,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311724901] [2024-11-07 06:16:53,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311724901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:16:53,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264346178] [2024-11-07 06:16:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:53,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:53,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:53,508 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 06:16:53,513 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 06:16:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:53,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 06:16:53,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 54 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-11-07 06:16:54,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-07 06:16:54,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264346178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:16:54,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:16:54,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-07 06:16:54,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989305485] [2024-11-07 06:16:54,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:16:54,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 06:16:54,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:54,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 06:16:54,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:16:54,577 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 5 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (51), 5 states have call predecessors, (51), 5 states have call successors, (51) [2024-11-07 06:16:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:54,903 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2024-11-07 06:16:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 06:16:54,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 5 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (51), 5 states have call predecessors, (51), 5 states have call successors, (51) Word has length 145 [2024-11-07 06:16:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:54,906 INFO L225 Difference]: With dead ends: 211 [2024-11-07 06:16:54,906 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 06:16:54,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-11-07 06:16:54,909 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 57 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:54,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 193 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:16:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 06:16:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-07 06:16:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 84 states have internal predecessors, (112), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 06:16:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-11-07 06:16:54,928 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 145 [2024-11-07 06:16:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:54,928 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-11-07 06:16:54,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 5 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (51), 5 states have call predecessors, (51), 5 states have call successors, (51) [2024-11-07 06:16:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-11-07 06:16:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 06:16:54,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:54,931 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:54,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 06:16:55,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:55,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:55,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:55,133 INFO L85 PathProgramCache]: Analyzing trace with hash -991198518, now seen corresponding path program 1 times [2024-11-07 06:16:55,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:55,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683065970] [2024-11-07 06:16:55,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:55,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:16:55,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608267920] [2024-11-07 06:16:55,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:55,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:55,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:55,255 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 06:16:55,257 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 06:16:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:16:55,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:16:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:16:55,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:16:55,595 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:16:55,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:16:55,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 06:16:55,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:55,804 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 06:16:55,943 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:16:55,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:16:55 BoogieIcfgContainer [2024-11-07 06:16:55,950 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:16:55,953 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:16:55,953 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:16:55,954 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:16:55,954 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:51" (3/4) ... [2024-11-07 06:16:55,956 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:16:55,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:16:55,958 INFO L158 Benchmark]: Toolchain (without parser) took 6011.87ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 84.9MB in the beginning and 45.5MB in the end (delta: 39.3MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2024-11-07 06:16:55,958 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:55,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.20ms. Allocated memory is still 109.1MB. Free memory was 84.7MB in the beginning and 69.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:16:55,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.85ms. Allocated memory is still 109.1MB. Free memory was 69.3MB in the beginning and 64.5MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:55,959 INFO L158 Benchmark]: Boogie Preprocessor took 99.10ms. Allocated memory is still 109.1MB. Free memory was 64.5MB in the beginning and 58.2MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:16:55,959 INFO L158 Benchmark]: RCFGBuilder took 675.79ms. Allocated memory is still 109.1MB. Free memory was 58.2MB in the beginning and 74.9MB in the end (delta: -16.7MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-11-07 06:16:55,959 INFO L158 Benchmark]: TraceAbstraction took 4838.18ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 74.0MB in the beginning and 45.5MB in the end (delta: 28.4MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2024-11-07 06:16:55,959 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 134.2MB. Free memory was 45.5MB in the beginning and 45.5MB in the end (delta: 19.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:55,962 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.96ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.20ms. Allocated memory is still 109.1MB. Free memory was 84.7MB in the beginning and 69.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.85ms. Allocated memory is still 109.1MB. Free memory was 69.3MB in the beginning and 64.5MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 99.10ms. Allocated memory is still 109.1MB. Free memory was 64.5MB in the beginning and 58.2MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 675.79ms. Allocated memory is still 109.1MB. Free memory was 58.2MB in the beginning and 74.9MB in the end (delta: -16.7MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4838.18ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 74.0MB in the beginning and 45.5MB in the end (delta: 28.4MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 134.2MB. Free memory was 45.5MB in the beginning and 45.5MB in the end (delta: 19.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryArithmeticFLOAToperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 128; [L25] unsigned char var_1_4 = 2; [L26] unsigned char var_1_5 = 2; [L27] unsigned char var_1_6 = 32; [L28] unsigned short int var_1_8 = 100; [L29] float var_1_9 = 255.75; [L30] signed char var_1_10 = 64; [L31] signed char var_1_11 = 32; [L32] signed char var_1_12 = 4; [L33] float var_1_13 = 0.0; [L34] float var_1_14 = 7.25; [L35] float var_1_15 = 8.125; [L36] float var_1_16 = 24.5; [L37] signed short int var_1_17 = -256; [L38] double var_1_18 = 31.5; [L39] float var_1_19 = 255.2; [L40] signed long int var_1_21 = -8; [L41] double var_1_22 = 0.5; [L42] unsigned short int var_1_23 = 200; [L43] double var_1_26 = 1.8; [L44] unsigned short int var_1_29 = 8; [L45] unsigned char var_1_37 = 1; [L46] unsigned char var_1_39 = 0; [L47] unsigned char var_1_40 = 0; [L48] unsigned long int var_1_41 = 10; [L49] unsigned char last_1_var_1_6 = 32; [L50] unsigned short int last_1_var_1_8 = 100; VAL [isInitial=0, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L164] last_1_var_1_6 = var_1_6 [L165] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L175] RET updateLastVariables() [L176] CALL updateVariables() [L129] var_1_2 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L130] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L131] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L131] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L132] var_1_3 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_3 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L133] RET assume_abort_if_not(var_1_3 >= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L134] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L134] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L135] var_1_4 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L136] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L137] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L137] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L138] var_1_5 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L139] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L140] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L140] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L141] var_1_10 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L142] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L143] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L143] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L144] var_1_11 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L145] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L146] CALL assume_abort_if_not(var_1_11 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L146] RET assume_abort_if_not(var_1_11 <= 64) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L147] var_1_12 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L148] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L149] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L149] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L151] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L152] var_1_14 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L153] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L154] var_1_16 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L155] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L156] var_1_39 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L157] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L158] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L158] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L159] var_1_40 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L160] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L161] CALL assume_abort_if_not(var_1_40 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L161] RET assume_abort_if_not(var_1_40 <= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L176] RET updateVariables() [L177] CALL step() [L54] signed long int stepLocal_0 = 64 + (var_1_5 / var_1_3); VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, stepLocal_0=64, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L55] COND TRUE stepLocal_0 != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6)) [L56] var_1_6 = var_1_4 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100, var_1_9=1023/4] [L60] var_1_19 = var_1_13 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100, var_1_9=1023/4] [L61] COND FALSE !(\read(var_1_2)) [L64] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100, var_1_9=1023/4] [L66] COND TRUE var_1_2 || (var_1_5 <= (var_1_3 / var_1_3)) [L67] var_1_37 = (var_1_39 || var_1_40) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100, var_1_9=1023/4] [L69] COND FALSE !((var_1_4 + ((((var_1_4) < (var_1_10)) ? (var_1_4) : (var_1_10)))) <= var_1_11) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100, var_1_9=1023/4] [L74] COND TRUE ((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5 [L75] var_1_9 = (64.8f - (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L79] COND FALSE !(var_1_2 || (var_1_16 <= var_1_13)) [L86] var_1_29 = (var_1_3 + (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) + var_1_5)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L88] var_1_15 = (var_1_14 + var_1_16) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L89] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L92] COND TRUE var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13)))) [L93] var_1_17 = var_1_4 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_17=63, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L98] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_17=63, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L105] COND FALSE !((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) [L110] var_1_18 = var_1_16 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L112] var_1_21 = -16 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L113] COND FALSE !(var_1_11 > var_1_3) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L116] COND TRUE (var_1_2 || var_1_2) || ((- var_1_16) <= var_1_14) [L117] var_1_26 = ((((9.99999999739E8) < (var_1_16)) ? (9.99999999739E8) : (var_1_16))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=1/2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L120] signed long int stepLocal_1 = var_1_3 - var_1_5; VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, stepLocal_1=126, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=1/2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L121] COND TRUE (var_1_17 + var_1_6) >= stepLocal_1 [L122] var_1_8 = ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=1/2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=127] [L126] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=127] [L177] RET step() [L178] CALL, EXPR property() [L168] EXPR ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 - var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 + var_1_5)))) && (((64 + (var_1_5 / var_1_3)) != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6))) ? (var_1_6 == ((unsigned char) var_1_4)) : (var_1_6 == ((unsigned char) 128)))) && (((var_1_17 + var_1_6) >= (var_1_3 - var_1_5)) ? (var_1_8 == ((unsigned short int) ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))))) : (var_1_8 == ((unsigned short int) var_1_6)))) && ((((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5) ? (var_1_9 == ((float) (64.8f - (var_1_13 - var_1_14)))) : (var_1_9 == ((float) var_1_13)))) && (var_1_15 == ((float) (var_1_14 + var_1_16)))) && (var_1_2 ? (var_1_17 == ((signed short int) (var_1_3 + var_1_12))) : ((var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) ? (var_1_17 == ((signed short int) var_1_4)) : (var_1_17 == ((signed short int) (var_1_5 - var_1_3)))))) && (((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) ? (((var_1_11 << var_1_12) > var_1_5) ? (var_1_18 == ((double) var_1_13)) : 1) : (var_1_18 == ((double) var_1_16))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=127] [L168-L169] return ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 - var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 + var_1_5)))) && (((64 + (var_1_5 / var_1_3)) != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6))) ? (var_1_6 == ((unsigned char) var_1_4)) : (var_1_6 == ((unsigned char) 128)))) && (((var_1_17 + var_1_6) >= (var_1_3 - var_1_5)) ? (var_1_8 == ((unsigned short int) ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))))) : (var_1_8 == ((unsigned short int) var_1_6)))) && ((((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5) ? (var_1_9 == ((float) (64.8f - (var_1_13 - var_1_14)))) : (var_1_9 == ((float) var_1_13)))) && (var_1_15 == ((float) (var_1_14 + var_1_16)))) && (var_1_2 ? (var_1_17 == ((signed short int) (var_1_3 + var_1_12))) : ((var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) ? (var_1_17 == ((signed short int) var_1_4)) : (var_1_17 == ((signed short int) (var_1_5 - var_1_3)))))) && (((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) ? (((var_1_11 << var_1_12) > var_1_5) ? (var_1_18 == ((double) var_1_13)) : 1) : (var_1_18 == ((double) var_1_16))) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 760 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 321 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 314 IncrementalHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 439 mSDtfsCounter, 314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 479 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 40 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1015 NumberOfCodeBlocks, 1015 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 862 ConstructedInterpolants, 0 QuantifiedInterpolants, 2252 SizeOfPredicates, 2 NumberOfNonLiveVariables, 351 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 4878/5040 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 06:16:56,001 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_fillercode_fillercodestructure_filler-pr-ci_file-20.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 f8764d0703f262f882fea925b2e1c51288e3d3f7182d2157f47a63a3f8cbf94f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:16:58,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:16:58,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:16:58,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:16:58,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:16:58,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:16:58,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:16:58,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:16:58,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:16:58,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:16:58,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:16:58,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:16:58,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:16:58,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:16:58,581 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:16:58,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:16:58,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:16:58,582 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:16:58,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:16:58,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:16:58,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:16:58,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:16:58,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:16:58,582 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:16:58,582 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:16:58,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:16:58,583 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:16:58,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:16:58,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:16:58,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:16:58,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:16:58,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:16:58,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:16:58,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:16:58,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:58,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:16:58,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:16:58,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:16:58,585 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:16:58,585 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:16:58,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:16:58,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:16:58,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:16:58,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:16:58,586 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 -> f8764d0703f262f882fea925b2e1c51288e3d3f7182d2157f47a63a3f8cbf94f [2024-11-07 06:16:58,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:16:58,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:16:58,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:16:58,930 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:16:58,933 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:16:58,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i [2024-11-07 06:17:00,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:17:00,791 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:17:00,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i [2024-11-07 06:17:00,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ec229fbb/ae9af8a2e8ec4e66bc273a4a74837ca8/FLAG5bec54657 [2024-11-07 06:17:00,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ec229fbb/ae9af8a2e8ec4e66bc273a4a74837ca8 [2024-11-07 06:17:00,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:17:00,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:17:00,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:17:00,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:17:00,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:17:00,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:17:00" (1/1) ... [2024-11-07 06:17:00,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d7fa0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:00, skipping insertion in model container [2024-11-07 06:17:00,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:17:00" (1/1) ... [2024-11-07 06:17:00,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:17:01,024 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_fillercode_fillercodestructure_filler-pr-ci_file-20.i[919,932] [2024-11-07 06:17:01,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:17:01,116 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:17:01,131 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_fillercode_fillercodestructure_filler-pr-ci_file-20.i[919,932] [2024-11-07 06:17:01,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:17:01,209 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:17:01,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01 WrapperNode [2024-11-07 06:17:01,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:17:01,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:17:01,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:17:01,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:17:01,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (1/1) ... [2024-11-07 06:17:01,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (1/1) ... [2024-11-07 06:17:01,280 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-11-07 06:17:01,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:17:01,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:17:01,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:17:01,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:17:01,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (1/1) ... [2024-11-07 06:17:01,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (1/1) ... [2024-11-07 06:17:01,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (1/1) ... [2024-11-07 06:17:01,332 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 06:17:01,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (1/1) ... [2024-11-07 06:17:01,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (1/1) ... [2024-11-07 06:17:01,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (1/1) ... [2024-11-07 06:17:01,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (1/1) ... [2024-11-07 06:17:01,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (1/1) ... [2024-11-07 06:17:01,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (1/1) ... [2024-11-07 06:17:01,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:17:01,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:17:01,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:17:01,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:17:01,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (1/1) ... [2024-11-07 06:17:01,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:17:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:17:01,424 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 06:17:01,431 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 06:17:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:17:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:17:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:17:01,453 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:17:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:17:01,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:17:01,555 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:17:01,557 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:17:11,456 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 06:17:11,456 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:17:11,471 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:17:11,472 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:17:11,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:17:11 BoogieIcfgContainer [2024-11-07 06:17:11,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:17:11,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:17:11,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:17:11,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:17:11,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:17:00" (1/3) ... [2024-11-07 06:17:11,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227c28f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:17:11, skipping insertion in model container [2024-11-07 06:17:11,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:01" (2/3) ... [2024-11-07 06:17:11,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227c28f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:17:11, skipping insertion in model container [2024-11-07 06:17:11,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:17:11" (3/3) ... [2024-11-07 06:17:11,485 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i [2024-11-07 06:17:11,498 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:17:11,498 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:17:11,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:17:11,561 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;@169dd6b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:17:11,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:17:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 06:17:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 06:17:11,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:11,581 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:17:11,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:11,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash 598315384, now seen corresponding path program 1 times [2024-11-07 06:17:11,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:17:11,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849051431] [2024-11-07 06:17:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:11,598 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 06:17:11,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:17:11,601 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 06:17:11,602 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 06:17:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:12,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:17:12,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:17:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-07 06:17:12,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:17:12,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:17:12,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849051431] [2024-11-07 06:17:12,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849051431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:17:12,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:17:12,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:17:12,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7412844] [2024-11-07 06:17:12,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:17:12,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:17:12,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:17:12,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:17:12,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:17:12,157 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 06:17:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:17:12,192 INFO L93 Difference]: Finished difference Result 141 states and 243 transitions. [2024-11-07 06:17:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:17:12,195 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 142 [2024-11-07 06:17:12,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:17:12,203 INFO L225 Difference]: With dead ends: 141 [2024-11-07 06:17:12,203 INFO L226 Difference]: Without dead ends: 70 [2024-11-07 06:17:12,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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 06:17:12,210 INFO L432 NwaCegarLoop]: 106 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, 106 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 06:17:12,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:17:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-07 06:17:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-07 06:17:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 06:17:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-07 06:17:12,250 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 142 [2024-11-07 06:17:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:17:12,251 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-07 06:17:12,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 06:17:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-07 06:17:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 06:17:12,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:12,255 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:17:12,271 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 06:17:12,455 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 06:17:12,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:12,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:12,457 INFO L85 PathProgramCache]: Analyzing trace with hash 907781746, now seen corresponding path program 1 times [2024-11-07 06:17:12,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:17:12,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882789701] [2024-11-07 06:17:12,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:12,459 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 06:17:12,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:17:12,462 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 06:17:12,463 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 06:17:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:12,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:17:12,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:17:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 06:17:13,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:17:13,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:17:13,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882789701] [2024-11-07 06:17:13,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882789701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:17:13,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:17:13,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:17:13,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559102789] [2024-11-07 06:17:13,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:17:13,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:17:13,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:17:13,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:17:13,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:17:13,019 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 06:17:17,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:21,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:17:21,801 INFO L93 Difference]: Finished difference Result 162 states and 246 transitions. [2024-11-07 06:17:21,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:17:21,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2024-11-07 06:17:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:17:21,851 INFO L225 Difference]: With dead ends: 162 [2024-11-07 06:17:21,851 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 06:17:21,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 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 06:17:21,853 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 33 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:17:21,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 186 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-07 06:17:21,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 06:17:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2024-11-07 06:17:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 06:17:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2024-11-07 06:17:21,864 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 142 [2024-11-07 06:17:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:17:21,866 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2024-11-07 06:17:21,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 06:17:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2024-11-07 06:17:21,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 06:17:21,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:21,868 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:17:21,885 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 06:17:22,072 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 06:17:22,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:22,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:22,074 INFO L85 PathProgramCache]: Analyzing trace with hash 302108317, now seen corresponding path program 1 times [2024-11-07 06:17:22,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:17:22,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820463736] [2024-11-07 06:17:22,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:22,074 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 06:17:22,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:17:22,078 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 06:17:22,079 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 06:17:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:22,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:17:22,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:17:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 06:17:22,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:17:22,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:17:22,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820463736] [2024-11-07 06:17:22,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820463736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:17:22,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:17:22,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:17:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245734744] [2024-11-07 06:17:22,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:17:22,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:17:22,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:17:22,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:17:22,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:17:22,611 INFO L87 Difference]: Start difference. First operand 79 states and 119 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 06:17:27,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:31,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:17:31,342 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2024-11-07 06:17:31,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:17:31,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-07 06:17:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:17:31,345 INFO L225 Difference]: With dead ends: 171 [2024-11-07 06:17:31,345 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 06:17:31,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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 06:17:31,347 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 29 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:17:31,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 201 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-07 06:17:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 06:17:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2024-11-07 06:17:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 06:17:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2024-11-07 06:17:31,361 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 143 [2024-11-07 06:17:31,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:17:31,364 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2024-11-07 06:17:31,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 06:17:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2024-11-07 06:17:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 06:17:31,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:31,367 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:17:31,381 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 06:17:31,567 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 06:17:31,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:31,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1386835425, now seen corresponding path program 1 times [2024-11-07 06:17:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:17:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785612691] [2024-11-07 06:17:31,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:31,569 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 06:17:31,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:17:31,571 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 06:17:31,572 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 06:17:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:31,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 06:17:31,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:17:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 497 proven. 102 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-07 06:17:36,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:17:37,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:17:37,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785612691] [2024-11-07 06:17:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785612691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:17:37,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1089466001] [2024-11-07 06:17:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:37,445 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:17:37,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:17:37,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 06:17:37,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-07 06:17:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:38,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 06:17:38,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:17:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-07 06:17:40,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:17:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-07 06:17:41,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1089466001] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:17:41,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:17:41,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 13 [2024-11-07 06:17:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542733109] [2024-11-07 06:17:41,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:17:41,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 06:17:41,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:17:41,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 06:17:41,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2024-11-07 06:17:41,439 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 4 states have call successors, (49), 4 states have call predecessors, (49), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2024-11-07 06:17:47,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:51,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:55,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:58,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:17:58,400 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2024-11-07 06:17:58,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 06:17:58,449 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 4 states have call successors, (49), 4 states have call predecessors, (49), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) Word has length 143 [2024-11-07 06:17:58,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:17:58,451 INFO L225 Difference]: With dead ends: 181 [2024-11-07 06:17:58,451 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 06:17:58,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 488 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2024-11-07 06:17:58,453 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:17:58,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 195 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 263 Invalid, 3 Unknown, 0 Unchecked, 16.6s Time] [2024-11-07 06:17:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 06:17:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-11-07 06:17:58,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 06:17:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2024-11-07 06:17:58,465 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 143 [2024-11-07 06:17:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:17:58,466 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2024-11-07 06:17:58,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 4 states have call successors, (49), 4 states have call predecessors, (49), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2024-11-07 06:17:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2024-11-07 06:17:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 06:17:58,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:58,468 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:17:58,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-07 06:17:58,684 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 06:17:58,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 06:17:58,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:58,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1331757272, now seen corresponding path program 1 times [2024-11-07 06:17:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:17:58,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056018936] [2024-11-07 06:17:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:58,872 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 06:17:58,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:17:58,874 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:17:58,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 06:17:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:59,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 06:17:59,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:18:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 166 proven. 272 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-07 06:18:05,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:18:06,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:18:06,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056018936] [2024-11-07 06:18:06,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056018936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:18:06,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2076320920] [2024-11-07 06:18:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:06,635 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:18:06,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:18:06,637 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 06:18:06,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-07 06:18:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:07,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 06:18:07,903 INFO L278 TraceCheckSpWp]: Computing forward predicates...