./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-38.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', '5466bf06a7e4128c8eade79479cd5c3b324b73667698a27af81adcadb4a0f58c'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-38.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 5466bf06a7e4128c8eade79479cd5c3b324b73667698a27af81adcadb4a0f58c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:09:24,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:09:25,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:09:25,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:09:25,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:09:25,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:09:25,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:09:25,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:09:25,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:09:25,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:09:25,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:09:25,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:09:25,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:09:25,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:09:25,134 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:09:25,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:09:25,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:09:25,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:09:25,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:09:25,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:09:25,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:09:25,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:09:25,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:09:25,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:09:25,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:09:25,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:09:25,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:09:25,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:09:25,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:09:25,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:09:25,138 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 -> 5466bf06a7e4128c8eade79479cd5c3b324b73667698a27af81adcadb4a0f58c [2024-11-07 08:09:25,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:09:25,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:09:25,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:09:25,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:09:25,478 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:09:25,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-38.i [2024-11-07 08:09:26,810 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:09:27,044 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:09:27,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-38.i [2024-11-07 08:09:27,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3b0c0f09/73ea26a27aeb48a8a874636ddf72a022/FLAGf5e7fc17a [2024-11-07 08:09:27,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3b0c0f09/73ea26a27aeb48a8a874636ddf72a022 [2024-11-07 08:09:27,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:09:27,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:09:27,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:09:27,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:09:27,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:09:27,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7742e65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27, skipping insertion in model container [2024-11-07 08:09:27,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:09:27,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-38.i[916,929] [2024-11-07 08:09:27,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:09:27,679 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:09:27,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-38.i[916,929] [2024-11-07 08:09:27,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:09:27,765 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:09:27,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27 WrapperNode [2024-11-07 08:09:27,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:09:27,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:09:27,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:09:27,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:09:27,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,854 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-07 08:09:27,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:09:27,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:09:27,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:09:27,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:09:27,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,906 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:09:27,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:09:27,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:09:27,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:09:27,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:09:27,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (1/1) ... [2024-11-07 08:09:27,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:09:27,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:09:27,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:09:27,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:09:28,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:09:28,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:09:28,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:09:28,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:09:28,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:09:28,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:09:28,072 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:09:28,073 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:09:28,507 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 08:09:28,507 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:09:28,522 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:09:28,522 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:09:28,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:09:28 BoogieIcfgContainer [2024-11-07 08:09:28,523 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:09:28,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:09:28,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:09:28,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:09:28,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:09:27" (1/3) ... [2024-11-07 08:09:28,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28360e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:09:28, skipping insertion in model container [2024-11-07 08:09:28,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:27" (2/3) ... [2024-11-07 08:09:28,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28360e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:09:28, skipping insertion in model container [2024-11-07 08:09:28,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:09:28" (3/3) ... [2024-11-07 08:09:28,536 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-38.i [2024-11-07 08:09:28,552 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:09:28,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:09:28,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:09:28,623 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;@236df59e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:09:28,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:09:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 49 states have (on average 1.530612244897959) internal successors, (75), 50 states have internal predecessors, (75), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:09:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 08:09:28,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:28,640 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:28,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:28,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1148538766, now seen corresponding path program 1 times [2024-11-07 08:09:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:28,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942203860] [2024-11-07 08:09:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:28,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:28,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:09:29,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:29,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942203860] [2024-11-07 08:09:29,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942203860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:09:29,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:09:29,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:09:29,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302545494] [2024-11-07 08:09:29,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:09:29,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:09:29,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:29,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:09:29,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:09:29,050 INFO L87 Difference]: Start difference. First operand has 68 states, 49 states have (on average 1.530612244897959) internal successors, (75), 50 states have internal predecessors, (75), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:09:29,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:29,076 INFO L93 Difference]: Finished difference Result 129 states and 224 transitions. [2024-11-07 08:09:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:09:29,078 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2024-11-07 08:09:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:29,084 INFO L225 Difference]: With dead ends: 129 [2024-11-07 08:09:29,084 INFO L226 Difference]: Without dead ends: 64 [2024-11-07 08:09:29,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:09:29,093 INFO L432 NwaCegarLoop]: 100 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, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:29,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:09:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-07 08:09:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-07 08:09:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 states have internal predecessors, (68), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:09:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2024-11-07 08:09:29,143 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 113 [2024-11-07 08:09:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:29,144 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2024-11-07 08:09:29,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:09:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2024-11-07 08:09:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 08:09:29,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:29,149 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:29,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:09:29,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:29,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:29,151 INFO L85 PathProgramCache]: Analyzing trace with hash 572573898, now seen corresponding path program 1 times [2024-11-07 08:09:29,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:29,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331011195] [2024-11-07 08:09:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:29,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:30,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:30,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:09:31,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:31,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331011195] [2024-11-07 08:09:31,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331011195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:09:31,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:09:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:09:31,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970172450] [2024-11-07 08:09:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:09:31,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:09:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:09:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:09:31,064 INFO L87 Difference]: Start difference. First operand 64 states and 100 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:31,448 INFO L93 Difference]: Finished difference Result 183 states and 283 transitions. [2024-11-07 08:09:31,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 08:09:31,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-07 08:09:31,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:31,451 INFO L225 Difference]: With dead ends: 183 [2024-11-07 08:09:31,451 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 08:09:31,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:09:31,453 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 140 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:31,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 352 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:09:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 08:09:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 80. [2024-11-07 08:09:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 62 states have internal predecessors, (96), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:09:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2024-11-07 08:09:31,476 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 113 [2024-11-07 08:09:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:31,478 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 128 transitions. [2024-11-07 08:09:31,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:31,478 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2024-11-07 08:09:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 08:09:31,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:31,481 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:31,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:09:31,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:31,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:31,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1273638476, now seen corresponding path program 1 times [2024-11-07 08:09:31,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:31,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603161933] [2024-11-07 08:09:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:31,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:09:31,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:31,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603161933] [2024-11-07 08:09:31,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603161933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:09:31,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:09:31,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:09:31,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263491402] [2024-11-07 08:09:31,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:09:31,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:09:31,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:31,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:09:31,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:09:31,659 INFO L87 Difference]: Start difference. First operand 80 states and 128 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:31,802 INFO L93 Difference]: Finished difference Result 324 states and 516 transitions. [2024-11-07 08:09:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:09:31,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-07 08:09:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:31,807 INFO L225 Difference]: With dead ends: 324 [2024-11-07 08:09:31,809 INFO L226 Difference]: Without dead ends: 247 [2024-11-07 08:09:31,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:09:31,811 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 202 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:31,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 380 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:09:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-07 08:09:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 152. [2024-11-07 08:09:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.5118110236220472) internal successors, (192), 128 states have internal predecessors, (192), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:09:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 236 transitions. [2024-11-07 08:09:31,835 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 236 transitions. Word has length 113 [2024-11-07 08:09:31,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:31,835 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 236 transitions. [2024-11-07 08:09:31,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 236 transitions. [2024-11-07 08:09:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 08:09:31,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:31,837 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:31,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:09:31,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:31,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash 290998844, now seen corresponding path program 1 times [2024-11-07 08:09:31,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:31,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102029164] [2024-11-07 08:09:31,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 08:09:32,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:32,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102029164] [2024-11-07 08:09:32,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102029164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:09:32,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313940148] [2024-11-07 08:09:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:32,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:09:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:09:32,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:09:32,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:09:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:32,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 08:09:32,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:09:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 249 proven. 18 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2024-11-07 08:09:32,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:09:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 27 proven. 18 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 08:09:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313940148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:09:32,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:09:32,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-07 08:09:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222205070] [2024-11-07 08:09:32,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:09:32,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:09:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:32,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:09:32,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:09:32,614 INFO L87 Difference]: Start difference. First operand 152 states and 236 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-07 08:09:32,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:32,932 INFO L93 Difference]: Finished difference Result 269 states and 408 transitions. [2024-11-07 08:09:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 08:09:32,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 114 [2024-11-07 08:09:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:32,935 INFO L225 Difference]: With dead ends: 269 [2024-11-07 08:09:32,935 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 08:09:32,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:09:32,936 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 181 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:32,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 220 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:09:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 08:09:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2024-11-07 08:09:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 89 states have internal predecessors, (120), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:09:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2024-11-07 08:09:32,955 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 114 [2024-11-07 08:09:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:32,955 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2024-11-07 08:09:32,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-07 08:09:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2024-11-07 08:09:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 08:09:32,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:32,960 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:32,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:09:33,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:09:33,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:33,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:33,161 INFO L85 PathProgramCache]: Analyzing trace with hash -104200684, now seen corresponding path program 1 times [2024-11-07 08:09:33,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:33,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302024106] [2024-11-07 08:09:33,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:09:33,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:33,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302024106] [2024-11-07 08:09:33,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302024106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:09:33,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:09:33,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:09:33,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245028265] [2024-11-07 08:09:33,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:09:33,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:09:33,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:33,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:09:33,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:09:33,325 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:33,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:33,412 INFO L93 Difference]: Finished difference Result 250 states and 352 transitions. [2024-11-07 08:09:33,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:09:33,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-11-07 08:09:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:33,415 INFO L225 Difference]: With dead ends: 250 [2024-11-07 08:09:33,415 INFO L226 Difference]: Without dead ends: 153 [2024-11-07 08:09:33,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:09:33,416 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 97 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:33,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 202 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:09:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-07 08:09:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2024-11-07 08:09:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 92 states have internal predecessors, (121), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:09:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2024-11-07 08:09:33,433 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 114 [2024-11-07 08:09:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:33,434 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2024-11-07 08:09:33,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2024-11-07 08:09:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 08:09:33,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:33,436 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:33,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:09:33,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:33,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash -913547310, now seen corresponding path program 1 times [2024-11-07 08:09:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:33,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979904126] [2024-11-07 08:09:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:33,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:09:33,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:33,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979904126] [2024-11-07 08:09:33,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979904126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:09:33,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:09:33,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:09:33,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341418617] [2024-11-07 08:09:33,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:09:33,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:09:33,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:33,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:09:33,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:09:33,778 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:33,844 INFO L93 Difference]: Finished difference Result 217 states and 299 transitions. [2024-11-07 08:09:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:09:33,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-11-07 08:09:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:33,847 INFO L225 Difference]: With dead ends: 217 [2024-11-07 08:09:33,849 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 08:09:33,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:09:33,850 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 87 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:33,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 167 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:09:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 08:09:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2024-11-07 08:09:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 78 states have internal predecessors, (100), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:09:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 132 transitions. [2024-11-07 08:09:33,872 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 132 transitions. Word has length 114 [2024-11-07 08:09:33,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:33,872 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 132 transitions. [2024-11-07 08:09:33,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 132 transitions. [2024-11-07 08:09:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 08:09:33,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:33,874 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:33,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:09:33,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:33,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:33,874 INFO L85 PathProgramCache]: Analyzing trace with hash -326741296, now seen corresponding path program 1 times [2024-11-07 08:09:33,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:33,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533727886] [2024-11-07 08:09:33,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:33,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:09:35,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:35,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533727886] [2024-11-07 08:09:35,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533727886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:09:35,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:09:35,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:09:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826236905] [2024-11-07 08:09:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:09:35,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:09:35,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:35,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:09:35,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:09:35,541 INFO L87 Difference]: Start difference. First operand 100 states and 132 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:09:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:35,805 INFO L93 Difference]: Finished difference Result 199 states and 263 transitions. [2024-11-07 08:09:35,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:09:35,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 114 [2024-11-07 08:09:35,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:35,808 INFO L225 Difference]: With dead ends: 199 [2024-11-07 08:09:35,808 INFO L226 Difference]: Without dead ends: 102 [2024-11-07 08:09:35,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:09:35,809 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 92 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:35,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 254 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:09:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-07 08:09:35,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-11-07 08:09:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:09:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2024-11-07 08:09:35,834 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 114 [2024-11-07 08:09:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:35,834 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2024-11-07 08:09:35,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:09:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2024-11-07 08:09:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 08:09:35,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:35,835 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:35,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 08:09:35,835 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:35,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:35,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1915089198, now seen corresponding path program 1 times [2024-11-07 08:09:35,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:35,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157581268] [2024-11-07 08:09:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:35,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:09:36,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:36,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157581268] [2024-11-07 08:09:36,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157581268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:09:36,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:09:36,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:09:36,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252728676] [2024-11-07 08:09:36,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:09:36,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:09:36,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:36,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:09:36,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:09:36,507 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:36,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:36,701 INFO L93 Difference]: Finished difference Result 292 states and 378 transitions. [2024-11-07 08:09:36,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:09:36,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-11-07 08:09:36,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:36,703 INFO L225 Difference]: With dead ends: 292 [2024-11-07 08:09:36,704 INFO L226 Difference]: Without dead ends: 195 [2024-11-07 08:09:36,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:09:36,705 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 124 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:36,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 357 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:09:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-07 08:09:36,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 101. [2024-11-07 08:09:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:09:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2024-11-07 08:09:36,723 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 114 [2024-11-07 08:09:36,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:36,723 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2024-11-07 08:09:36,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2024-11-07 08:09:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 08:09:36,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:36,724 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:36,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 08:09:36,725 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:36,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash -455369612, now seen corresponding path program 1 times [2024-11-07 08:09:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019270466] [2024-11-07 08:09:36,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:36,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:09:37,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:37,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019270466] [2024-11-07 08:09:37,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019270466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:09:37,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:09:37,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:09:37,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905395919] [2024-11-07 08:09:37,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:09:37,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:09:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:37,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:09:37,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:09:37,079 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:37,253 INFO L93 Difference]: Finished difference Result 258 states and 338 transitions. [2024-11-07 08:09:37,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:09:37,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-11-07 08:09:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:37,255 INFO L225 Difference]: With dead ends: 258 [2024-11-07 08:09:37,257 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 08:09:37,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:09:37,258 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 149 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:37,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 207 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:09:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 08:09:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2024-11-07 08:09:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:09:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2024-11-07 08:09:37,277 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 115 [2024-11-07 08:09:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:37,279 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2024-11-07 08:09:37,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2024-11-07 08:09:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 08:09:37,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:37,281 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:37,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 08:09:37,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:37,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:37,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1686609170, now seen corresponding path program 1 times [2024-11-07 08:09:37,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:37,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288503604] [2024-11-07 08:09:37,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:37,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 08:09:37,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:37,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288503604] [2024-11-07 08:09:37,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288503604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:09:37,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169395811] [2024-11-07 08:09:37,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:37,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:09:37,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:09:37,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:09:37,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 08:09:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:37,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 08:09:37,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:09:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 08:09:38,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:09:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 08:09:38,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169395811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:09:38,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:09:38,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-07 08:09:38,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841048268] [2024-11-07 08:09:38,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:09:38,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 08:09:38,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:38,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 08:09:38,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:09:38,613 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-07 08:09:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:39,269 INFO L93 Difference]: Finished difference Result 397 states and 502 transitions. [2024-11-07 08:09:39,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 08:09:39,269 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) Word has length 115 [2024-11-07 08:09:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:39,271 INFO L225 Difference]: With dead ends: 397 [2024-11-07 08:09:39,271 INFO L226 Difference]: Without dead ends: 295 [2024-11-07 08:09:39,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2024-11-07 08:09:39,273 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 283 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:39,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 394 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:09:39,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-07 08:09:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 108. [2024-11-07 08:09:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 85 states have internal predecessors, (106), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:09:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 138 transitions. [2024-11-07 08:09:39,299 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 138 transitions. Word has length 115 [2024-11-07 08:09:39,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:39,300 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 138 transitions. [2024-11-07 08:09:39,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-07 08:09:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2024-11-07 08:09:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 08:09:39,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:39,302 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:39,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 08:09:39,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:09:39,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:39,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:39,503 INFO L85 PathProgramCache]: Analyzing trace with hash 356288937, now seen corresponding path program 1 times [2024-11-07 08:09:39,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:39,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577659065] [2024-11-07 08:09:39,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:39,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:09:39,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:39,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577659065] [2024-11-07 08:09:39,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577659065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:09:39,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:09:39,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:09:39,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018721616] [2024-11-07 08:09:39,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:09:39,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:09:39,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:39,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:09:39,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:09:39,634 INFO L87 Difference]: Start difference. First operand 108 states and 138 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:39,657 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2024-11-07 08:09:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:09:39,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-11-07 08:09:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:39,662 INFO L225 Difference]: With dead ends: 213 [2024-11-07 08:09:39,662 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 08:09:39,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:09:39,663 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:39,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 90 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:09:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 08:09:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-07 08:09:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:09:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2024-11-07 08:09:39,683 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 115 [2024-11-07 08:09:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:39,683 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2024-11-07 08:09:39,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2024-11-07 08:09:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 08:09:39,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:39,685 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:39,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 08:09:39,685 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:39,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:39,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2078275609, now seen corresponding path program 1 times [2024-11-07 08:09:39,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:39,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497084211] [2024-11-07 08:09:39,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:09:39,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:39,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497084211] [2024-11-07 08:09:39,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497084211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:09:39,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:09:39,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:09:39,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182817420] [2024-11-07 08:09:39,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:09:39,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:09:39,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:39,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:09:39,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:09:39,987 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:40,077 INFO L93 Difference]: Finished difference Result 238 states and 302 transitions. [2024-11-07 08:09:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:09:40,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-07 08:09:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:40,081 INFO L225 Difference]: With dead ends: 238 [2024-11-07 08:09:40,081 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 08:09:40,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:09:40,082 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 27 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:40,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 226 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:09:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 08:09:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2024-11-07 08:09:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 90 states have internal predecessors, (110), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:09:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2024-11-07 08:09:40,101 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 116 [2024-11-07 08:09:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:40,101 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2024-11-07 08:09:40,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:09:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2024-11-07 08:09:40,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 08:09:40,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:40,103 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:40,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 08:09:40,103 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:40,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash 881227339, now seen corresponding path program 1 times [2024-11-07 08:09:40,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:40,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243467735] [2024-11-07 08:09:40,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:40,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:09:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:09:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:09:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:09:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:09:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:09:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:09:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:09:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:09:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:09:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:09:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:09:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:09:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:09:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:09:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:09:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 08:09:40,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:09:40,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243467735] [2024-11-07 08:09:40,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243467735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:09:40,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692932190] [2024-11-07 08:09:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:40,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:09:40,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:09:40,539 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 08:09:40,540 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 08:09:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:40,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 08:09:40,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:09:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 08:09:40,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:09:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 08:09:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692932190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:09:41,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:09:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-07 08:09:41,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073804793] [2024-11-07 08:09:41,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:09:41,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 08:09:41,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:09:41,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 08:09:41,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:09:41,252 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-07 08:09:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:09:42,130 INFO L93 Difference]: Finished difference Result 325 states and 407 transitions. [2024-11-07 08:09:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 08:09:42,131 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) Word has length 116 [2024-11-07 08:09:42,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:09:42,133 INFO L225 Difference]: With dead ends: 325 [2024-11-07 08:09:42,133 INFO L226 Difference]: Without dead ends: 215 [2024-11-07 08:09:42,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2024-11-07 08:09:42,134 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 195 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 08:09:42,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 395 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 08:09:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-07 08:09:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 110. [2024-11-07 08:09:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.206896551724138) internal successors, (105), 87 states have internal predecessors, (105), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:09:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 137 transitions. [2024-11-07 08:09:42,157 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 137 transitions. Word has length 116 [2024-11-07 08:09:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:09:42,157 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 137 transitions. [2024-11-07 08:09:42,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-07 08:09:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2024-11-07 08:09:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 08:09:42,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:09:42,159 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:42,177 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 08:09:42,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:09:42,360 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:09:42,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:09:42,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1552300797, now seen corresponding path program 1 times [2024-11-07 08:09:42,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:09:42,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374036327] [2024-11-07 08:09:42,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:42,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:09:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:09:42,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011403954] [2024-11-07 08:09:42,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:42,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:09:42,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:09:42,443 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:09:42,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 08:09:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:09:42,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:09:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:09:43,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:09:43,095 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:09:43,096 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:09:43,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 08:09:43,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-07 08:09:43,301 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:09:43,400 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:09:43,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:09:43 BoogieIcfgContainer [2024-11-07 08:09:43,405 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:09:43,406 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:09:43,406 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:09:43,406 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:09:43,406 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:09:28" (3/4) ... [2024-11-07 08:09:43,410 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:09:43,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:09:43,412 INFO L158 Benchmark]: Toolchain (without parser) took 16027.15ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 91.8MB in the beginning and 112.7MB in the end (delta: -21.0MB). Peak memory consumption was 144.3MB. Max. memory is 16.1GB. [2024-11-07 08:09:43,412 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:09:43,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.82ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 75.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:09:43,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.75ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 70.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:09:43,413 INFO L158 Benchmark]: Boogie Preprocessor took 79.17ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 59.7MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:09:43,414 INFO L158 Benchmark]: RCFGBuilder took 587.41ms. Allocated memory is still 117.4MB. Free memory was 59.7MB in the beginning and 78.4MB in the end (delta: -18.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-07 08:09:43,414 INFO L158 Benchmark]: TraceAbstraction took 14877.44ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 77.4MB in the beginning and 112.8MB in the end (delta: -35.4MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. [2024-11-07 08:09:43,415 INFO L158 Benchmark]: Witness Printer took 5.18ms. Allocated memory is still 285.2MB. Free memory was 112.8MB in the beginning and 112.7MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:09:43,417 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.47ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.82ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 75.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.75ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 70.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 79.17ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 59.7MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 587.41ms. Allocated memory is still 117.4MB. Free memory was 59.7MB in the beginning and 78.4MB in the end (delta: -18.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14877.44ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 77.4MB in the beginning and 112.8MB in the end (delta: -35.4MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. * Witness Printer took 5.18ms. Allocated memory is still 285.2MB. Free memory was 112.8MB in the beginning and 112.7MB in the end (delta: 71.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 someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryArithmeticFLOAToperation at line 134. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 200; [L23] unsigned short int var_1_5 = 42139; [L24] unsigned short int var_1_7 = 1; [L25] double var_1_9 = 0.1; [L26] float var_1_12 = 10000000000.5; [L27] float var_1_13 = 255.6; [L28] float var_1_14 = 128.2; [L29] signed long int var_1_15 = 500; [L30] unsigned char var_1_16 = 0; [L31] unsigned char var_1_17 = 0; [L32] unsigned char var_1_18 = 0; [L33] signed char var_1_19 = -5; [L34] signed char var_1_20 = -1; [L35] signed char var_1_21 = 8; [L36] float var_1_22 = 3.75; [L37] signed short int var_1_23 = 10; [L38] unsigned long int var_1_24 = 8; [L39] unsigned char var_1_25 = 5; [L40] unsigned char var_1_26 = 50; [L41] float var_1_27 = 4.5; [L42] unsigned short int var_1_28 = 5; [L43] unsigned long int var_1_29 = 50; [L44] double var_1_30 = 3.5; [L45] unsigned char var_1_31 = 1; [L46] float last_1_var_1_12 = 10000000000.5; [L47] signed short int last_1_var_1_23 = 10; [L48] unsigned long int last_1_var_1_24 = 8; [L49] unsigned char last_1_var_1_25 = 5; [L50] unsigned long int last_1_var_1_29 = 50; [L51] unsigned char last_1_var_1_31 = 1; VAL [isInitial=0, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=42139, var_1_7=1, var_1_9=1/10] [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L171] last_1_var_1_12 = var_1_12 [L172] last_1_var_1_23 = var_1_23 [L173] last_1_var_1_24 = var_1_24 [L174] last_1_var_1_25 = var_1_25 [L175] last_1_var_1_29 = var_1_29 [L176] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=42139, var_1_7=1, var_1_9=1/10] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L144] var_1_5 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L145] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L146] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L146] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L147] var_1_9 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L148] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L149] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L149] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L151] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L152] var_1_14 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L153] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L154] var_1_17 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L155] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L156] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L156] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L157] var_1_18 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L158] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L159] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L159] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L160] var_1_20 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_20 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L161] RET assume_abort_if_not(var_1_20 >= -127) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L162] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L162] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L163] var_1_21 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L164] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L165] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L165] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L166] var_1_26 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L167] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L168] CALL assume_abort_if_not(var_1_26 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L168] RET assume_abort_if_not(var_1_26 <= 254) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L187] RET updateVariables() [L188] CALL step() [L55] unsigned short int stepLocal_1 = var_1_5; [L56] unsigned long int stepLocal_0 = (last_1_var_1_25 + last_1_var_1_23) + (last_1_var_1_29 / var_1_5); VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L57] COND FALSE !((last_1_var_1_12 / var_1_9) != last_1_var_1_12) [L76] var_1_7 = var_1_5 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L78] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L81] COND TRUE \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L82] COND FALSE !(((((var_1_29) > (var_1_5)) ? (var_1_29) : (var_1_5))) < ((((4) < 0 ) ? -(4) : (4)))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L86] var_1_19 = ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) [L87] var_1_30 = var_1_14 [L88] var_1_31 = var_1_17 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L89] COND FALSE !(var_1_13 != 4.5f) [L96] var_1_16 = (var_1_18 || (! var_1_17)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L98] COND TRUE var_1_16 || var_1_17 [L99] var_1_22 = ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L101] COND TRUE \read(var_1_31) [L102] var_1_25 = (4 + 8) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L106] COND TRUE var_1_13 != var_1_22 [L107] var_1_28 = var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L111] COND FALSE !(\read(var_1_16)) [L114] var_1_1 = (((((var_1_5 - var_1_25)) < ((var_1_25 + (256 + 1)))) ? ((var_1_5 - var_1_25)) : ((var_1_25 + (256 + 1))))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L116] unsigned short int stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, stepLocal_3=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L117] COND TRUE stepLocal_3 >= ((((var_1_25) < (var_1_7)) ? (var_1_25) : (var_1_7))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L118] COND TRUE ! var_1_16 [L119] var_1_15 = var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L122] COND FALSE !(var_1_16 || var_1_18) [L125] var_1_24 = ((((2u) > (100u)) ? (2u) : (100u))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L127] signed long int stepLocal_2 = ((((-64) < (var_1_28)) ? (-64) : (var_1_28))) + (var_1_25 << 1); VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, stepLocal_2=-40, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L128] COND TRUE stepLocal_2 < var_1_7 [L129] var_1_12 = (((((var_1_13 - 128.9f)) < (var_1_14)) ? ((var_1_13 - 128.9f)) : (var_1_14))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L131] COND TRUE var_1_1 != var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L132] COND TRUE var_1_23 >= -128 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L133] COND TRUE var_1_30 != ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) [L134] var_1_27 = (var_1_13 - (99999.4f + 9.999999999125E9f)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return ((((((((((((((var_1_16 ? (var_1_1 == ((unsigned short int) (((((var_1_25 + var_1_25)) < ((var_1_5 - ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))) ? ((var_1_25 + var_1_25)) : ((var_1_5 - ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_25)) < ((var_1_25 + (256 + 1)))) ? ((var_1_5 - var_1_25)) : ((var_1_25 + (256 + 1)))))))) && (((last_1_var_1_12 / var_1_9) != last_1_var_1_12) ? ((var_1_9 >= last_1_var_1_12) ? (var_1_7 == ((unsigned short int) last_1_var_1_25)) : ((var_1_5 <= last_1_var_1_25) ? ((last_1_var_1_25 < ((last_1_var_1_25 + last_1_var_1_23) + (last_1_var_1_29 / var_1_5))) ? (last_1_var_1_31 ? (var_1_7 == ((unsigned short int) 5)) : (var_1_7 == ((unsigned short int) last_1_var_1_25))) : (var_1_7 == ((unsigned short int) last_1_var_1_25))) : (var_1_7 == ((unsigned short int) last_1_var_1_25)))) : (var_1_7 == ((unsigned short int) var_1_5)))) && (((((((-64) < (var_1_28)) ? (-64) : (var_1_28))) + (var_1_25 << 1)) < var_1_7) ? (var_1_12 == ((float) (((((var_1_13 - 128.9f)) < (var_1_14)) ? ((var_1_13 - 128.9f)) : (var_1_14))))) : 1)) && ((var_1_5 >= ((((var_1_25) < (var_1_7)) ? (var_1_25) : (var_1_7)))) ? ((! var_1_16) ? (var_1_15 == ((signed long int) var_1_25)) : 1) : 1)) && ((var_1_13 != 4.5f) ? (var_1_31 ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) (! 0)))) : (var_1_16 == ((unsigned char) (var_1_18 || (! var_1_17)))))) && (var_1_19 == ((signed char) ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))) && ((var_1_16 || var_1_17) ? (var_1_22 == ((float) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))))) : 1)) && (var_1_17 ? ((((((var_1_29) > (var_1_5)) ? (var_1_29) : (var_1_5))) < ((((4) < 0 ) ? -(4) : (4)))) ? (var_1_23 == ((signed short int) var_1_20)) : 1) : 1)) && ((var_1_16 || var_1_18) ? (var_1_24 == ((unsigned long int) ((((last_1_var_1_24) > (var_1_25)) ? (last_1_var_1_24) : (var_1_25))))) : (var_1_24 == ((unsigned long int) ((((2u) > (100u)) ? (2u) : (100u))))))) && (var_1_31 ? (var_1_25 == ((unsigned char) (4 + 8))) : (var_1_25 == ((unsigned char) ((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))))) && ((var_1_1 != var_1_25) ? ((var_1_23 >= -128) ? ((var_1_30 != ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) ? (var_1_27 == ((float) (var_1_13 - (99999.4f + 9.999999999125E9f)))) : (var_1_27 == ((float) ((((0.8f) > (var_1_13)) ? (0.8f) : (var_1_13)))))) : 1) : (var_1_27 == ((float) var_1_14)))) && ((var_1_13 != var_1_22) ? (var_1_28 == ((unsigned short int) var_1_25)) : (var_1_28 == ((unsigned short int) (var_1_5 - 10))))) && (var_1_18 ? (var_1_29 == ((unsigned long int) (((((var_1_7 + 100000000u)) > (var_1_26)) ? ((var_1_7 + 100000000u)) : (var_1_26))))) : 1)) && (var_1_30 == ((double) var_1_14))) && (var_1_31 == ((unsigned char) var_1_17)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1663 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1624 mSDsluCounter, 3344 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1934 mSDsCounter, 215 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1558 IncrementalHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 215 mSolverCounterUnsat, 1410 mSDtfsCounter, 1558 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1241 GetRequests, 1146 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=3, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 655 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2065 NumberOfCodeBlocks, 2065 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2157 ConstructedInterpolants, 0 QuantifiedInterpolants, 7449 SizeOfPredicates, 8 NumberOfNonLiveVariables, 952 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 8787/9120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 08:09:43,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-38.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 5466bf06a7e4128c8eade79479cd5c3b324b73667698a27af81adcadb4a0f58c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:09:45,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:09:45,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:09:45,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:09:45,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:09:45,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:09:45,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:09:45,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:09:45,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:09:45,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:09:45,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:09:45,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:09:45,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:09:45,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:09:45,733 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:09:45,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:09:45,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:09:45,734 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:09:45,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:09:45,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:09:45,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:09:45,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:09:45,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:09:45,735 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:09:45,735 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:09:45,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:09:45,735 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:09:45,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:09:45,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:09:45,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:09:45,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:09:45,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:09:45,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:09:45,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:09:45,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:09:45,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:09:45,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:09:45,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:09:45,737 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:09:45,737 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:09:45,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:09:45,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:09:45,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:09:45,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:09:45,737 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 -> 5466bf06a7e4128c8eade79479cd5c3b324b73667698a27af81adcadb4a0f58c [2024-11-07 08:09:46,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:09:46,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:09:46,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:09:46,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:09:46,042 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:09:46,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-38.i [2024-11-07 08:09:47,456 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:09:47,728 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:09:47,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-38.i [2024-11-07 08:09:47,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8a06f5a8/5dc4b9d9bf514e03bc5c3e7e6cd434c4/FLAG871aa7326 [2024-11-07 08:09:47,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8a06f5a8/5dc4b9d9bf514e03bc5c3e7e6cd434c4 [2024-11-07 08:09:47,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:09:47,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:09:47,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:09:47,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:09:47,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:09:47,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:09:47" (1/1) ... [2024-11-07 08:09:47,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afe1637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:47, skipping insertion in model container [2024-11-07 08:09:47,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:09:47" (1/1) ... [2024-11-07 08:09:47,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:09:47,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-38.i[916,929] [2024-11-07 08:09:48,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:09:48,070 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:09:48,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-38.i[916,929] [2024-11-07 08:09:48,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:09:48,169 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:09:48,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48 WrapperNode [2024-11-07 08:09:48,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:09:48,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:09:48,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:09:48,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:09:48,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (1/1) ... [2024-11-07 08:09:48,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (1/1) ... [2024-11-07 08:09:48,229 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-11-07 08:09:48,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:09:48,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:09:48,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:09:48,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:09:48,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (1/1) ... [2024-11-07 08:09:48,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (1/1) ... [2024-11-07 08:09:48,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (1/1) ... [2024-11-07 08:09:48,277 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:09:48,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (1/1) ... [2024-11-07 08:09:48,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (1/1) ... [2024-11-07 08:09:48,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (1/1) ... [2024-11-07 08:09:48,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (1/1) ... [2024-11-07 08:09:48,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (1/1) ... [2024-11-07 08:09:48,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (1/1) ... [2024-11-07 08:09:48,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:09:48,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:09:48,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:09:48,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:09:48,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (1/1) ... [2024-11-07 08:09:48,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:09:48,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:09:48,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:09:48,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:09:48,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:09:48,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:09:48,387 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:09:48,387 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:09:48,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:09:48,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:09:48,475 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:09:48,477 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:10:02,437 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 08:10:02,437 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:10:02,446 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:10:02,446 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:10:02,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:10:02 BoogieIcfgContainer [2024-11-07 08:10:02,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:10:02,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:10:02,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:10:02,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:10:02,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:09:47" (1/3) ... [2024-11-07 08:10:02,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39358dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:10:02, skipping insertion in model container [2024-11-07 08:10:02,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:09:48" (2/3) ... [2024-11-07 08:10:02,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39358dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:10:02, skipping insertion in model container [2024-11-07 08:10:02,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:10:02" (3/3) ... [2024-11-07 08:10:02,458 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-38.i [2024-11-07 08:10:02,470 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:10:02,470 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:10:02,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:10:02,537 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;@6643fb48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:10:02,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:10:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 49 states have (on average 1.530612244897959) internal successors, (75), 50 states have internal predecessors, (75), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:10:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 08:10:02,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:02,555 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:10:02,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:02,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1148538766, now seen corresponding path program 1 times [2024-11-07 08:10:02,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:10:02,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003010213] [2024-11-07 08:10:02,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:02,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:10:02,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:10:02,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:10:02,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 08:10:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:03,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:10:03,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:10:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-07 08:10:03,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:10:03,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:10:03,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003010213] [2024-11-07 08:10:03,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003010213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:10:03,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:10:03,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:10:03,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521874058] [2024-11-07 08:10:03,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:10:03,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:10:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:10:03,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:10:03,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:10:03,541 INFO L87 Difference]: Start difference. First operand has 68 states, 49 states have (on average 1.530612244897959) internal successors, (75), 50 states have internal predecessors, (75), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:10:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:03,566 INFO L93 Difference]: Finished difference Result 129 states and 224 transitions. [2024-11-07 08:10:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:10:03,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2024-11-07 08:10:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:03,575 INFO L225 Difference]: With dead ends: 129 [2024-11-07 08:10:03,576 INFO L226 Difference]: Without dead ends: 64 [2024-11-07 08:10:03,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:10:03,581 INFO L432 NwaCegarLoop]: 100 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, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:03,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:10:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-07 08:10:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-07 08:10:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 states have internal predecessors, (68), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:10:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2024-11-07 08:10:03,631 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 113 [2024-11-07 08:10:03,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:03,631 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2024-11-07 08:10:03,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:10:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2024-11-07 08:10:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 08:10:03,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:03,638 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:10:03,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 08:10:03,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:10:03,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:03,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:03,839 INFO L85 PathProgramCache]: Analyzing trace with hash 572573898, now seen corresponding path program 1 times [2024-11-07 08:10:03,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:10:03,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110126261] [2024-11-07 08:10:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:03,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:10:03,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:10:03,842 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:10:03,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:10:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:04,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 08:10:04,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:10:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 249 proven. 18 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2024-11-07 08:10:06,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:10:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 27 proven. 18 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 08:10:09,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:10:09,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110126261] [2024-11-07 08:10:09,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110126261] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:10:09,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:10:09,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 08:10:09,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123771493] [2024-11-07 08:10:09,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:10:09,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:10:09,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:10:09,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:10:09,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:10:09,407 INFO L87 Difference]: Start difference. First operand 64 states and 100 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 08:10:16,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:10:20,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:10:24,411 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 08:10:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:24,415 INFO L93 Difference]: Finished difference Result 133 states and 204 transitions. [2024-11-07 08:10:24,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:10:24,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 113 [2024-11-07 08:10:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:24,585 INFO L225 Difference]: With dead ends: 133 [2024-11-07 08:10:24,585 INFO L226 Difference]: Without dead ends: 72 [2024-11-07 08:10:24,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:10:24,586 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 124 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:24,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 195 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 14.4s Time] [2024-11-07 08:10:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-07 08:10:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-11-07 08:10:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:10:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2024-11-07 08:10:24,598 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 113 [2024-11-07 08:10:24,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:24,598 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2024-11-07 08:10:24,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 08:10:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2024-11-07 08:10:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 08:10:24,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:24,601 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:10:24,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:10:24,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:10:24,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:24,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:24,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1421570808, now seen corresponding path program 1 times [2024-11-07 08:10:24,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:10:24,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939663531] [2024-11-07 08:10:24,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:24,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:10:24,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:10:24,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:10:24,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:10:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:25,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 08:10:25,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:10:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 243 proven. 27 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-07 08:10:28,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:10:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 08:10:31,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:10:31,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939663531] [2024-11-07 08:10:31,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939663531] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:10:31,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:10:31,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 08:10:31,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673090870] [2024-11-07 08:10:31,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:10:31,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:10:31,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:10:31,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:10:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:10:31,296 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 08:10:38,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:10:42,626 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 08:10:46,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:10:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:10:47,527 INFO L93 Difference]: Finished difference Result 153 states and 226 transitions. [2024-11-07 08:10:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:10:47,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 113 [2024-11-07 08:10:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:10:47,529 INFO L225 Difference]: With dead ends: 153 [2024-11-07 08:10:47,529 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 08:10:47,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:10:47,530 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 109 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2024-11-07 08:10:47,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 209 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 139 Invalid, 3 Unknown, 0 Unchecked, 15.7s Time] [2024-11-07 08:10:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 08:10:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2024-11-07 08:10:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 58 states have internal predecessors, (76), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:10:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2024-11-07 08:10:47,542 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 113 [2024-11-07 08:10:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:10:47,543 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2024-11-07 08:10:47,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 08:10:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2024-11-07 08:10:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 08:10:47,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:47,545 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:10:47,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 08:10:47,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:10:47,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:47,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:47,747 INFO L85 PathProgramCache]: Analyzing trace with hash -805265262, now seen corresponding path program 1 times [2024-11-07 08:10:47,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:10:47,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101852010] [2024-11-07 08:10:47,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:47,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:10:47,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:10:47,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:10:47,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 08:10:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:10:48,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 08:10:48,618 INFO L278 TraceCheckSpWp]: Computing forward predicates...