./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-72.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_fillercodesize_normal_file-72.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', 'fd1ba7d185f4c09a6b14ae8d8b991d063f5f8f309435a694ac46f2c9fbfc2733'] 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_fillercodesize_normal_file-72.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 fd1ba7d185f4c09a6b14ae8d8b991d063f5f8f309435a694ac46f2c9fbfc2733 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:36:28,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:36:28,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:36:28,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:36:28,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:36:28,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:36:28,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:36:28,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:36:28,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:36:28,819 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:36:28,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:36:28,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:36:28,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:36:28,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:36:28,821 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:36:28,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:36:28,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:36:28,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:36:28,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:36:28,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:36:28,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:36:28,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:36:28,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:36:28,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:36:28,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:36:28,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:36:28,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:36:28,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:36:28,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:36:28,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:36:28,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:36:28,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:36:28,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:36:28,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:36:28,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:36:28,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:36:28,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:36:28,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:36:28,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:36:28,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:36:28,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:36:28,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:36:28,824 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 -> fd1ba7d185f4c09a6b14ae8d8b991d063f5f8f309435a694ac46f2c9fbfc2733 [2024-11-07 04:36:29,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:36:29,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:36:29,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:36:29,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:36:29,141 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:36:29,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-72.i [2024-11-07 04:36:30,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:36:30,684 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:36:30,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-72.i [2024-11-07 04:36:30,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2062f68bf/3adf1dc5016f443099baa9a0f45e0f98/FLAGe5519f32b [2024-11-07 04:36:30,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2062f68bf/3adf1dc5016f443099baa9a0f45e0f98 [2024-11-07 04:36:30,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:36:30,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:36:30,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:36:30,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:36:30,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:36:30,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:36:30" (1/1) ... [2024-11-07 04:36:30,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d34833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:30, skipping insertion in model container [2024-11-07 04:36:30,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:36:30" (1/1) ... [2024-11-07 04:36:30,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:36:30,870 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_fillercodesize_normal_file-72.i[913,926] [2024-11-07 04:36:30,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:36:30,940 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:36:30,951 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_fillercodesize_normal_file-72.i[913,926] [2024-11-07 04:36:30,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:36:31,006 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:36:31,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31 WrapperNode [2024-11-07 04:36:31,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:36:31,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:36:31,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:36:31,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:36:31,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (1/1) ... [2024-11-07 04:36:31,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (1/1) ... [2024-11-07 04:36:31,058 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-11-07 04:36:31,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:36:31,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:36:31,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:36:31,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:36:31,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (1/1) ... [2024-11-07 04:36:31,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (1/1) ... [2024-11-07 04:36:31,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (1/1) ... [2024-11-07 04:36:31,099 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 04:36:31,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (1/1) ... [2024-11-07 04:36:31,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (1/1) ... [2024-11-07 04:36:31,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (1/1) ... [2024-11-07 04:36:31,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (1/1) ... [2024-11-07 04:36:31,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (1/1) ... [2024-11-07 04:36:31,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (1/1) ... [2024-11-07 04:36:31,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:36:31,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:36:31,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:36:31,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:36:31,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (1/1) ... [2024-11-07 04:36:31,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:36:31,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:36:31,158 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 04:36:31,165 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 04:36:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:36:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:36:31,183 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:36:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:36:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:36:31,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:36:31,269 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:36:31,272 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:36:31,533 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 04:36:31,534 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:36:31,543 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:36:31,543 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:36:31,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:36:31 BoogieIcfgContainer [2024-11-07 04:36:31,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:36:31,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:36:31,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:36:31,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:36:31,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:36:30" (1/3) ... [2024-11-07 04:36:31,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d65c1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:36:31, skipping insertion in model container [2024-11-07 04:36:31,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:31" (2/3) ... [2024-11-07 04:36:31,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d65c1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:36:31, skipping insertion in model container [2024-11-07 04:36:31,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:36:31" (3/3) ... [2024-11-07 04:36:31,554 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-72.i [2024-11-07 04:36:31,566 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:36:31,567 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:36:31,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:36:31,637 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;@1b4dc8eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:36:31,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:36:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 04:36:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 04:36:31,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:36:31,653 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:31,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:36:31,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:36:31,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1883188630, now seen corresponding path program 1 times [2024-11-07 04:36:31,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:36:31,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699531188] [2024-11-07 04:36:31,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:31,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:36:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:31,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:36:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:31,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:36:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:31,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:36:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:36:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:36:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:31,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:36:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:31,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:36:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:31,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:36:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:36:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:36:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:36:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:36:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:36:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:36:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:36:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:36:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:36:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 04:36:32,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:36:32,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699531188] [2024-11-07 04:36:32,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699531188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:36:32,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:36:32,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:36:32,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242044133] [2024-11-07 04:36:32,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:36:32,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:36:32,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:36:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:36:32,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:36:32,076 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 04:36:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:36:32,102 INFO L93 Difference]: Finished difference Result 109 states and 183 transitions. [2024-11-07 04:36:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:36:32,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112 [2024-11-07 04:36:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:36:32,112 INFO L225 Difference]: With dead ends: 109 [2024-11-07 04:36:32,113 INFO L226 Difference]: Without dead ends: 54 [2024-11-07 04:36:32,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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 04:36:32,121 INFO L432 NwaCegarLoop]: 79 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, 79 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 04:36:32,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:36:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-07 04:36:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-07 04:36:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 04:36:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-07 04:36:32,169 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 112 [2024-11-07 04:36:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:36:32,170 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-07 04:36:32,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 04:36:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-07 04:36:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 04:36:32,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:36:32,175 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:32,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:36:32,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:36:32,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:36:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash 693056024, now seen corresponding path program 1 times [2024-11-07 04:36:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:36:32,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139709041] [2024-11-07 04:36:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:32,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:36:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:36:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:36:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:36:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:36:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:36:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:36:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:36:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:36:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:36:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:36:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:36:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:36:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:36:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:36:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:36:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:36:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:36:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 04:36:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:36:32,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139709041] [2024-11-07 04:36:32,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139709041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:36:32,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:36:32,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:36:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877156468] [2024-11-07 04:36:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:36:32,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:36:32,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:36:32,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:36:32,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:36:32,758 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:36:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:36:32,820 INFO L93 Difference]: Finished difference Result 122 states and 178 transitions. [2024-11-07 04:36:32,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:36:32,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 112 [2024-11-07 04:36:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:36:32,823 INFO L225 Difference]: With dead ends: 122 [2024-11-07 04:36:32,824 INFO L226 Difference]: Without dead ends: 71 [2024-11-07 04:36:32,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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 04:36:32,826 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 18 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:36:32,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 155 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:36:32,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-07 04:36:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2024-11-07 04:36:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 04:36:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-11-07 04:36:32,844 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 112 [2024-11-07 04:36:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:36:32,846 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-11-07 04:36:32,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:36:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-11-07 04:36:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 04:36:32,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:36:32,847 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:32,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:36:32,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:36:32,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:36:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1944172839, now seen corresponding path program 1 times [2024-11-07 04:36:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:36:32,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310992040] [2024-11-07 04:36:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:36:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:36:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:36:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:36:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:36:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:36:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:36:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:36:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:36:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:36:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:36:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:36:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:36:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:36:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:36:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:36:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:36:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:36:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 04:36:33,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:36:33,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310992040] [2024-11-07 04:36:33,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310992040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:36:33,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:36:33,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:36:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494424849] [2024-11-07 04:36:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:36:33,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:36:33,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:36:33,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:36:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:36:33,133 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 04:36:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:36:33,308 INFO L93 Difference]: Finished difference Result 164 states and 243 transitions. [2024-11-07 04:36:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:36:33,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2024-11-07 04:36:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:36:33,310 INFO L225 Difference]: With dead ends: 164 [2024-11-07 04:36:33,310 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 04:36:33,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:36:33,311 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 121 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:36:33,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 134 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:36:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 04:36:33,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 58. [2024-11-07 04:36:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 04:36:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-11-07 04:36:33,328 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 113 [2024-11-07 04:36:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:36:33,328 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-11-07 04:36:33,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 04:36:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-11-07 04:36:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 04:36:33,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:36:33,330 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:33,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:36:33,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:36:33,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:36:33,332 INFO L85 PathProgramCache]: Analyzing trace with hash 228743335, now seen corresponding path program 1 times [2024-11-07 04:36:33,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:36:33,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503542202] [2024-11-07 04:36:33,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:33,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:36:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:36:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:36:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:36:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:36:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:36:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:36:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:36:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:36:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:36:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:36:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:36:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:36:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:36:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:36:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:36:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:36:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:36:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 04:36:33,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:36:33,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503542202] [2024-11-07 04:36:33,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503542202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:36:33,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:36:33,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:36:33,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696416571] [2024-11-07 04:36:33,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:36:33,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:36:33,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:36:33,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:36:33,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:36:33,762 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:36:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:36:33,967 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2024-11-07 04:36:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:36:33,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2024-11-07 04:36:33,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:36:33,969 INFO L225 Difference]: With dead ends: 169 [2024-11-07 04:36:33,969 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 04:36:33,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:36:33,970 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 56 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:36:33,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 211 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:36:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 04:36:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2024-11-07 04:36:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 states have internal predecessors, (74), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:36:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 142 transitions. [2024-11-07 04:36:34,005 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 142 transitions. Word has length 113 [2024-11-07 04:36:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:36:34,007 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 142 transitions. [2024-11-07 04:36:34,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:36:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2024-11-07 04:36:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 04:36:34,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:36:34,008 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:34,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:36:34,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:36:34,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:36:34,009 INFO L85 PathProgramCache]: Analyzing trace with hash -29422103, now seen corresponding path program 1 times [2024-11-07 04:36:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:36:34,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803261293] [2024-11-07 04:36:34,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:34,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:36:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:36:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:36:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:36:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:36:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:36:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:36:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:36:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:36:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:36:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:36:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:36:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:36:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:36:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:36:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:36:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:36:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:36:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 04:36:34,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:36:34,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803261293] [2024-11-07 04:36:34,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803261293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:36:34,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949656336] [2024-11-07 04:36:34,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:36:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:36:34,313 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 04:36:34,314 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 04:36:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:34,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 04:36:34,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:36:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-07 04:36:34,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:36:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 04:36:34,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949656336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:36:34,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 04:36:34,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 04:36:34,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784882650] [2024-11-07 04:36:34,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 04:36:34,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 04:36:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:36:34,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 04:36:34,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:36:34,862 INFO L87 Difference]: Start difference. First operand 96 states and 142 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 04:36:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:36:35,094 INFO L93 Difference]: Finished difference Result 163 states and 234 transitions. [2024-11-07 04:36:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 04:36:35,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 113 [2024-11-07 04:36:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:36:35,098 INFO L225 Difference]: With dead ends: 163 [2024-11-07 04:36:35,098 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 04:36:35,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-07 04:36:35,099 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 60 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:36:35,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 170 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:36:35,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 04:36:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2024-11-07 04:36:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.2) internal successors, (78), 65 states have internal predecessors, (78), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:36:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2024-11-07 04:36:35,123 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 113 [2024-11-07 04:36:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:36:35,125 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2024-11-07 04:36:35,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 04:36:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2024-11-07 04:36:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 04:36:35,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:36:35,128 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:35,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 04:36:35,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:36:35,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:36:35,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:36:35,332 INFO L85 PathProgramCache]: Analyzing trace with hash -422449113, now seen corresponding path program 1 times [2024-11-07 04:36:35,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:36:35,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802794888] [2024-11-07 04:36:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:36:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:36:35,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817803654] [2024-11-07 04:36:35,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:35,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:36:35,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:36:35,437 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 04:36:35,440 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 04:36:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:35,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 04:36:35,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:36:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 04:36:36,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:36:36,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:36:36,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802794888] [2024-11-07 04:36:36,197 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 04:36:36,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817803654] [2024-11-07 04:36:36,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817803654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:36:36,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:36:36,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:36:36,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266431640] [2024-11-07 04:36:36,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:36:36,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:36:36,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:36:36,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:36:36,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:36:36,199 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:36:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:36:36,331 INFO L93 Difference]: Finished difference Result 182 states and 252 transitions. [2024-11-07 04:36:36,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:36:36,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2024-11-07 04:36:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:36:36,334 INFO L225 Difference]: With dead ends: 182 [2024-11-07 04:36:36,334 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 04:36:36,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:36:36,335 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 46 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:36:36,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 212 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:36:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 04:36:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2024-11-07 04:36:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 65 states have internal predecessors, (77), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:36:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2024-11-07 04:36:36,370 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 113 [2024-11-07 04:36:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:36:36,370 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2024-11-07 04:36:36,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:36:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2024-11-07 04:36:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 04:36:36,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:36:36,372 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:36,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 04:36:36,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:36:36,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:36:36,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:36:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash 304896849, now seen corresponding path program 1 times [2024-11-07 04:36:36,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:36:36,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20961916] [2024-11-07 04:36:36,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:36,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:36:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:36:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:36:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:36:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:36:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:36:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:36:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:36:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:36:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:36:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:36:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:36:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:36:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:36:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:36:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:36:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:36:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:36:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 04:36:36,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:36:36,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20961916] [2024-11-07 04:36:36,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20961916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:36:36,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:36:36,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:36:36,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703481250] [2024-11-07 04:36:36,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:36:36,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:36:36,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:36:36,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:36:36,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:36:36,691 INFO L87 Difference]: Start difference. First operand 104 states and 145 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:36:36,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:36:36,815 INFO L93 Difference]: Finished difference Result 219 states and 306 transitions. [2024-11-07 04:36:36,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:36:36,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 114 [2024-11-07 04:36:36,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:36:36,817 INFO L225 Difference]: With dead ends: 219 [2024-11-07 04:36:36,817 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 04:36:36,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:36:36,818 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:36:36,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 147 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:36:36,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 04:36:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 99. [2024-11-07 04:36:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 60 states have internal predecessors, (70), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:36:36,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-11-07 04:36:36,853 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 114 [2024-11-07 04:36:36,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:36:36,853 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-11-07 04:36:36,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:36:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-11-07 04:36:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 04:36:36,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:36:36,855 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:36,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 04:36:36,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:36:36,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:36:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash -292533512, now seen corresponding path program 1 times [2024-11-07 04:36:36,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:36:36,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515549807] [2024-11-07 04:36:36,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:36,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:36:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:36:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:36:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:36:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:36:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:36:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:36:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:36:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:36:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:36:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:36:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:36:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:36,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:36:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:37,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:36:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:37,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:36:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:37,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:36:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:37,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:36:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:37,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:36:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 04:36:37,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:36:37,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515549807] [2024-11-07 04:36:37,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515549807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:36:37,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:36:37,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:36:37,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249556996] [2024-11-07 04:36:37,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:36:37,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:36:37,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:36:37,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:36:37,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:36:37,021 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:36:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:36:37,127 INFO L93 Difference]: Finished difference Result 170 states and 234 transitions. [2024-11-07 04:36:37,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:36:37,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 114 [2024-11-07 04:36:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:36:37,129 INFO L225 Difference]: With dead ends: 170 [2024-11-07 04:36:37,130 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 04:36:37,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:36:37,131 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 46 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:36:37,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 213 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:36:37,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 04:36:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2024-11-07 04:36:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:36:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2024-11-07 04:36:37,155 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 114 [2024-11-07 04:36:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:36:37,155 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2024-11-07 04:36:37,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:36:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2024-11-07 04:36:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 04:36:37,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:36:37,156 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:37,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 04:36:37,157 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:36:37,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:36:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1667516812, now seen corresponding path program 1 times [2024-11-07 04:36:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:36:37,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420538940] [2024-11-07 04:36:37,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:37,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:36:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:36:37,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728103721] [2024-11-07 04:36:37,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:37,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:36:37,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:36:37,227 INFO L229 MonitoredProcess]: Starting monitored process 4 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 04:36:37,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 04:36:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:36:37,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:36:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:36:37,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:36:37,703 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:36:37,704 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:36:37,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 04:36:37,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:36:37,910 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:36:38,011 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:36:38,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:36:38 BoogieIcfgContainer [2024-11-07 04:36:38,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:36:38,019 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:36:38,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:36:38,019 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:36:38,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:36:31" (3/4) ... [2024-11-07 04:36:38,022 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:36:38,023 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:36:38,024 INFO L158 Benchmark]: Toolchain (without parser) took 7306.72ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 91.9MB in the beginning and 143.1MB in the end (delta: -51.1MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2024-11-07 04:36:38,024 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 81.7MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:36:38,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.68ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 78.2MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:36:38,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.72ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 75.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:36:38,025 INFO L158 Benchmark]: Boogie Preprocessor took 64.21ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 72.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:36:38,026 INFO L158 Benchmark]: RCFGBuilder took 416.87ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 54.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:36:38,026 INFO L158 Benchmark]: TraceAbstraction took 6472.07ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 54.1MB in the beginning and 143.1MB in the end (delta: -89.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:36:38,026 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 192.9MB. Free memory was 143.1MB in the beginning and 143.1MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:36:38,027 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.21ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 81.7MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.68ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 78.2MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.72ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 75.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.21ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 72.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 416.87ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 54.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6472.07ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 54.1MB in the beginning and 143.1MB in the end (delta: -89.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 192.9MB. Free memory was 143.1MB in the beginning and 143.1MB in the end (delta: 69.3kB). 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 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_10 = 2; [L24] signed char var_1_11 = 1; [L25] float var_1_14 = 64.3; [L26] signed char var_1_16 = 32; [L27] unsigned char var_1_17 = 1; [L28] unsigned char var_1_18 = 0; [L29] unsigned char var_1_19 = 0; [L30] double var_1_20 = 9.25; [L31] double var_1_21 = 255.05; [L32] double var_1_22 = 25.5; [L33] unsigned char var_1_23 = 2; [L34] unsigned char var_1_25 = 1; [L35] unsigned short int var_1_26 = 5; [L36] unsigned char var_1_27 = 128; [L37] unsigned char var_1_28 = 1; [L38] signed long int var_1_29 = 128; [L39] unsigned long int var_1_31 = 1; [L40] unsigned char last_1_var_1_17 = 1; [L41] double last_1_var_1_20 = 9.25; [L42] unsigned char last_1_var_1_23 = 2; [L43] unsigned short int last_1_var_1_26 = 5; [L44] signed long int last_1_var_1_29 = 128; VAL [isInitial=0, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L120] last_1_var_1_17 = var_1_17 [L121] last_1_var_1_20 = var_1_20 [L122] last_1_var_1_23 = var_1_23 [L123] last_1_var_1_26 = var_1_26 [L124] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L134] RET updateLastVariables() [L135] CALL updateVariables() [L91] var_1_11 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L92] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L93] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L93] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L94] var_1_14 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L95] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L96] var_1_16 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_16 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L97] RET assume_abort_if_not(var_1_16 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L98] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L98] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L99] var_1_18 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L100] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L101] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L101] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L102] var_1_19 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L103] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L104] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L104] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L105] var_1_21 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L106] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L107] var_1_22 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L108] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L109] var_1_25 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L110] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L111] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L111] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L112] var_1_27 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L113] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L114] CALL assume_abort_if_not(var_1_27 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L114] RET assume_abort_if_not(var_1_27 <= 255) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1] [L115] var_1_28 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1] [L116] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1] [L117] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L117] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L135] RET updateVariables() [L136] CALL step() [L48] COND FALSE !((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L51] COND TRUE last_1_var_1_17 || last_1_var_1_17 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L52] COND TRUE (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20) [L53] var_1_10 = (var_1_11 + var_1_16) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L61] COND TRUE (last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26 [L62] var_1_23 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L64] var_1_17 = (var_1_18 && var_1_19) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L65] COND FALSE !(! var_1_18) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L68] COND TRUE 256 >= var_1_10 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L69] COND FALSE !(var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) [L72] var_1_26 = var_1_28 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L77] signed long int stepLocal_0 = var_1_23 * var_1_26; VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L78] COND FALSE !(((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) [L85] var_1_1 = -50 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=16, var_1_29=128, var_1_31=1] [L87] var_1_31 = var_1_26 [L88] var_1_29 = var_1_1 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=16, var_1_29=-50, var_1_31=16] [L136] RET step() [L137] CALL, EXPR property() [L127-L128] return ((((((((((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) ? (((var_1_23 * var_1_26) <= (~ var_1_26)) ? (var_1_1 == ((signed short int) (((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) + var_1_23))) : (var_1_1 == ((signed short int) var_1_10))) : (var_1_1 == ((signed short int) -50))) && (((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) ? (var_1_10 == ((signed char) (var_1_11 + 10))) : ((last_1_var_1_17 || last_1_var_1_17) ? (((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20)) ? (var_1_10 == ((signed char) (var_1_11 + var_1_16))) : (var_1_10 == ((signed char) var_1_11))) : (var_1_10 == ((signed char) var_1_16))))) && (var_1_17 == ((unsigned char) (var_1_18 && var_1_19)))) && ((! var_1_18) ? (var_1_20 == ((double) ((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22))))) : 1)) && (((last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_25)) : 1)) && ((256 >= var_1_10) ? ((var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) ? (var_1_26 == ((unsigned short int) 16)) : (var_1_26 == ((unsigned short int) var_1_28))) : (var_1_26 == ((unsigned short int) var_1_25)))) && (var_1_29 == ((signed long int) var_1_1))) && (var_1_31 == ((unsigned long int) var_1_26)) ; VAL [\result=0, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=16, var_1_29=-50, var_1_31=16] [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=16, var_1_29=-50, var_1_31=16] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=16, var_1_29=-50, var_1_31=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 9, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 441 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 436 mSDsluCounter, 1321 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 706 mSDsCounter, 268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 258 IncrementalHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 268 mSolverCounterUnsat, 615 mSDtfsCounter, 258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 629 GetRequests, 604 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 180 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1360 NumberOfCodeBlocks, 1360 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1120 ConstructedInterpolants, 0 QuantifiedInterpolants, 2914 SizeOfPredicates, 2 NumberOfNonLiveVariables, 569 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 5341/5440 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 04:36:38,059 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_fillercodesize_normal_file-72.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 fd1ba7d185f4c09a6b14ae8d8b991d063f5f8f309435a694ac46f2c9fbfc2733 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:36:40,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:36:40,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:36:40,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:36:40,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:36:40,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:36:40,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:36:40,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:36:40,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:36:40,404 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:36:40,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:36:40,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:36:40,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:36:40,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:36:40,408 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:36:40,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:36:40,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:36:40,409 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:36:40,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:36:40,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:36:40,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:36:40,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:36:40,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:36:40,410 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:36:40,410 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:36:40,410 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:36:40,410 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:36:40,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:36:40,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:36:40,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:36:40,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:36:40,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:36:40,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:36:40,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:36:40,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:36:40,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:36:40,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:36:40,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:36:40,412 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:36:40,412 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:36:40,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:36:40,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:36:40,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:36:40,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:36:40,413 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 -> fd1ba7d185f4c09a6b14ae8d8b991d063f5f8f309435a694ac46f2c9fbfc2733 [2024-11-07 04:36:40,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:36:40,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:36:40,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:36:40,695 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:36:40,695 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:36:40,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-72.i [2024-11-07 04:36:42,071 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:36:42,333 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:36:42,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-72.i [2024-11-07 04:36:42,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c31b767e/15c5f30a780e47ea8ac7113457865e89/FLAG1981c6111 [2024-11-07 04:36:42,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c31b767e/15c5f30a780e47ea8ac7113457865e89 [2024-11-07 04:36:42,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:36:42,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:36:42,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:36:42,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:36:42,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:36:42,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34681403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42, skipping insertion in model container [2024-11-07 04:36:42,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:36:42,539 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_fillercodesize_normal_file-72.i[913,926] [2024-11-07 04:36:42,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:36:42,617 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:36:42,628 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_fillercodesize_normal_file-72.i[913,926] [2024-11-07 04:36:42,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:36:42,693 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:36:42,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42 WrapperNode [2024-11-07 04:36:42,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:36:42,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:36:42,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:36:42,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:36:42,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,748 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-11-07 04:36:42,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:36:42,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:36:42,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:36:42,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:36:42,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,776 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 04:36:42,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:36:42,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:36:42,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:36:42,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:36:42,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (1/1) ... [2024-11-07 04:36:42,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:36:42,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:36:42,829 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 04:36:42,832 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 04:36:42,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:36:42,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:36:42,856 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:36:42,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:36:42,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:36:42,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:36:42,949 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:36:42,951 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:36:51,844 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 04:36:51,844 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:36:51,853 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:36:51,853 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:36:51,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:36:51 BoogieIcfgContainer [2024-11-07 04:36:51,853 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:36:51,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:36:51,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:36:51,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:36:51,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:36:42" (1/3) ... [2024-11-07 04:36:51,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6f45f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:36:51, skipping insertion in model container [2024-11-07 04:36:51,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:42" (2/3) ... [2024-11-07 04:36:51,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6f45f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:36:51, skipping insertion in model container [2024-11-07 04:36:51,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:36:51" (3/3) ... [2024-11-07 04:36:51,867 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-72.i [2024-11-07 04:36:51,879 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:36:51,880 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:36:51,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:36:51,940 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;@12653ab6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:36:51,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:36:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 04:36:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 04:36:51,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:36:51,953 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:51,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:36:51,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:36:51,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1883188630, now seen corresponding path program 1 times [2024-11-07 04:36:51,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:36:51,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378817175] [2024-11-07 04:36:51,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:51,966 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 04:36:51,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:36:51,970 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 04:36:51,971 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 04:36:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:52,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:36:52,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:36:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-11-07 04:36:52,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:36:52,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:36:52,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378817175] [2024-11-07 04:36:52,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378817175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:36:52,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:36:52,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:36:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853754730] [2024-11-07 04:36:52,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:36:52,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:36:52,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:36:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:36:52,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:36:52,478 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 04:36:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:36:52,500 INFO L93 Difference]: Finished difference Result 109 states and 183 transitions. [2024-11-07 04:36:52,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:36:52,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112 [2024-11-07 04:36:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:36:52,506 INFO L225 Difference]: With dead ends: 109 [2024-11-07 04:36:52,506 INFO L226 Difference]: Without dead ends: 54 [2024-11-07 04:36:52,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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 04:36:52,511 INFO L432 NwaCegarLoop]: 78 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, 78 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 04:36:52,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:36:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-07 04:36:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-07 04:36:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 04:36:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-07 04:36:52,540 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 112 [2024-11-07 04:36:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:36:52,540 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-07 04:36:52,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 04:36:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-07 04:36:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 04:36:52,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:36:52,547 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:52,561 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 04:36:52,748 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 04:36:52,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:36:52,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:36:52,749 INFO L85 PathProgramCache]: Analyzing trace with hash 228743335, now seen corresponding path program 1 times [2024-11-07 04:36:52,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:36:52,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976718581] [2024-11-07 04:36:52,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:36:52,750 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 04:36:52,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:36:52,753 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 04:36:52,754 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 04:36:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:36:53,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 04:36:53,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:36:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 04:36:55,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:36:55,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:36:55,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976718581] [2024-11-07 04:36:55,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976718581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:36:55,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:36:55,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:36:55,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493032511] [2024-11-07 04:36:55,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:36:55,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:36:55,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:36:55,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:36:55,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:36:55,601 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:36:59,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:02,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:07,029 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 04:37:07,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:07,030 INFO L93 Difference]: Finished difference Result 165 states and 241 transitions. [2024-11-07 04:37:07,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:37:07,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2024-11-07 04:37:07,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:07,072 INFO L225 Difference]: With dead ends: 165 [2024-11-07 04:37:07,073 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 04:37:07,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:37:07,074 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 35 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:07,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 209 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 11.3s Time] [2024-11-07 04:37:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 04:37:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2024-11-07 04:37:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:37:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-11-07 04:37:07,100 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 113 [2024-11-07 04:37:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:07,100 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-11-07 04:37:07,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:37:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-11-07 04:37:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 04:37:07,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:07,103 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:07,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 04:37:07,304 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 04:37:07,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:07,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:07,305 INFO L85 PathProgramCache]: Analyzing trace with hash 358658936, now seen corresponding path program 1 times [2024-11-07 04:37:07,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:37:07,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82907608] [2024-11-07 04:37:07,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:07,306 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 04:37:07,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:37:07,310 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 04:37:07,311 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 04:37:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:07,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 04:37:07,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:37:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 04:37:08,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:37:08,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:37:08,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82907608] [2024-11-07 04:37:08,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82907608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:08,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:08,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:37:08,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346502104] [2024-11-07 04:37:08,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:08,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:37:08,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:37:08,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:37:08,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:37:08,852 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:37:13,175 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 04:37:17,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:21,241 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 04:37:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:21,242 INFO L93 Difference]: Finished difference Result 157 states and 228 transitions. [2024-11-07 04:37:21,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:37:21,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 114 [2024-11-07 04:37:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:21,286 INFO L225 Difference]: With dead ends: 157 [2024-11-07 04:37:21,286 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 04:37:21,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:37:21,288 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 35 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:21,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 216 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 12.3s Time] [2024-11-07 04:37:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 04:37:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2024-11-07 04:37:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:37:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-11-07 04:37:21,315 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 114 [2024-11-07 04:37:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:21,317 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-11-07 04:37:21,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:37:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-11-07 04:37:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 04:37:21,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:21,320 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:21,337 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 04:37:21,520 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 04:37:21,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:21,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:21,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1976258036, now seen corresponding path program 1 times [2024-11-07 04:37:21,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:37:21,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614844770] [2024-11-07 04:37:21,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:21,522 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 04:37:21,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:37:21,525 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 04:37:21,526 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 04:37:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:21,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 04:37:21,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:37:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 04:37:24,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:37:24,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:37:24,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614844770] [2024-11-07 04:37:24,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614844770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:24,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:24,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:37:24,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322966593] [2024-11-07 04:37:24,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:24,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:37:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:37:24,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:37:24,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:37:24,722 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:37:29,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:33,094 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 04:37:37,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:41,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:41,286 INFO L93 Difference]: Finished difference Result 157 states and 227 transitions. [2024-11-07 04:37:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:37:41,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 115 [2024-11-07 04:37:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:41,328 INFO L225 Difference]: With dead ends: 157 [2024-11-07 04:37:41,328 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 04:37:41,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:37:41,329 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:41,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 211 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 16.5s Time] [2024-11-07 04:37:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 04:37:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2024-11-07 04:37:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:37:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 132 transitions. [2024-11-07 04:37:41,348 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 132 transitions. Word has length 115 [2024-11-07 04:37:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:41,348 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 132 transitions. [2024-11-07 04:37:41,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 04:37:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 132 transitions. [2024-11-07 04:37:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 04:37:41,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:41,352 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:41,366 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 04:37:41,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:37:41,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:41,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:41,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2060543822, now seen corresponding path program 1 times [2024-11-07 04:37:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:37:41,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172899728] [2024-11-07 04:37:41,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:41,554 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 04:37:41,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:37:41,556 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:37:41,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 04:37:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:41,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 04:37:41,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:37:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-07 04:37:42,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:37:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 04:37:43,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:37:43,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172899728] [2024-11-07 04:37:43,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172899728] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:37:43,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 04:37:43,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 04:37:43,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241571265] [2024-11-07 04:37:43,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 04:37:43,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 04:37:43,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:37:43,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 04:37:43,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:37:43,546 INFO L87 Difference]: Start difference. First operand 91 states and 132 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 04:37:48,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:52,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:52,229 INFO L93 Difference]: Finished difference Result 154 states and 217 transitions. [2024-11-07 04:37:52,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 04:37:52,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 115 [2024-11-07 04:37:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:52,232 INFO L225 Difference]: With dead ends: 154 [2024-11-07 04:37:52,232 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 04:37:52,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-07 04:37:52,233 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 78 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:52,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 143 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 117 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2024-11-07 04:37:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 04:37:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2024-11-07 04:37:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:37:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2024-11-07 04:37:52,251 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 115 [2024-11-07 04:37:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:52,251 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2024-11-07 04:37:52,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 04:37:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2024-11-07 04:37:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 04:37:52,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:52,253 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:52,268 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 (6)] Ended with exit code 0 [2024-11-07 04:37:52,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:37:52,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:52,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1667516812, now seen corresponding path program 1 times [2024-11-07 04:37:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:37:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378959134] [2024-11-07 04:37:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:52,455 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 04:37:52,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:37:52,457 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 04:37:52,458 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 04:37:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:52,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 04:37:52,788 INFO L278 TraceCheckSpWp]: Computing forward predicates...