./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.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', 'fb001b1eda7dbc98350c0ec0af56acebc2e34bf2aac7fab255c878fcc02f2c5f'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.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 fb001b1eda7dbc98350c0ec0af56acebc2e34bf2aac7fab255c878fcc02f2c5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:16:19,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:16:19,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:16:19,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:16:19,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:16:19,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:16:19,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:16:19,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:16:19,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:16:19,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:16:19,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:16:19,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:16:19,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:16:19,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:16:19,512 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:16:19,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:16:19,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:16:19,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:16:19,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:19,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:16:19,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:16:19,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:16:19,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:16:19,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:16:19,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:16:19,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:16:19,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:16:19,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:16:19,515 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 -> fb001b1eda7dbc98350c0ec0af56acebc2e34bf2aac7fab255c878fcc02f2c5f [2024-11-07 06:16:19,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:16:19,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:16:19,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:16:19,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:16:19,912 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:16:19,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i [2024-11-07 06:16:21,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:16:21,666 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:16:21,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i [2024-11-07 06:16:21,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87d3199f3/579104ca1060404ab0b64742a358306a/FLAG288db4c53 [2024-11-07 06:16:21,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87d3199f3/579104ca1060404ab0b64742a358306a [2024-11-07 06:16:21,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:16:21,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:16:21,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:16:21,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:16:21,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:16:21,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:16:21" (1/1) ... [2024-11-07 06:16:21,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76743f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:21, skipping insertion in model container [2024-11-07 06:16:21,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:16:21" (1/1) ... [2024-11-07 06:16:21,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:16:21,904 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i[919,932] [2024-11-07 06:16:21,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:16:22,016 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:16:22,029 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i[919,932] [2024-11-07 06:16:22,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:16:22,078 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:16:22,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22 WrapperNode [2024-11-07 06:16:22,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:16:22,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:16:22,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:16:22,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:16:22,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,151 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-07 06:16:22,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:16:22,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:16:22,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:16:22,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:16:22,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,203 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 06:16:22,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,218 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:16:22,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:16:22,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:16:22,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:16:22,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:22,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:22,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 06:16:22,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 06:16:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:16:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:16:22,316 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:16:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:16:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:16:22,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:16:22,413 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:16:22,415 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:16:22,789 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 06:16:22,789 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:16:22,801 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:16:22,802 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:16:22,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:22 BoogieIcfgContainer [2024-11-07 06:16:22,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:16:22,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:16:22,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:16:22,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:16:22,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:16:21" (1/3) ... [2024-11-07 06:16:22,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac74cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:16:22, skipping insertion in model container [2024-11-07 06:16:22,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (2/3) ... [2024-11-07 06:16:22,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac74cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:16:22, skipping insertion in model container [2024-11-07 06:16:22,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:22" (3/3) ... [2024-11-07 06:16:22,817 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i [2024-11-07 06:16:22,833 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:16:22,834 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:16:22,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:16:22,916 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;@5657026b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:16:22,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:16:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:16:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 06:16:22,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:22,936 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:22,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:22,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1304056074, now seen corresponding path program 1 times [2024-11-07 06:16:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013609691] [2024-11-07 06:16:22,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:16:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:16:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:16:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:16:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:16:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:16:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:16:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:16:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:16:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:16:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:16:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:16:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:16:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:16:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:16:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:16:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:16:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:16:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:16:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:16:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 06:16:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:16:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:16:23,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:23,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013609691] [2024-11-07 06:16:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013609691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:23,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:23,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:16:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438936380] [2024-11-07 06:16:23,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:23,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:16:23,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:23,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:16:23,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:16:23,467 INFO L87 Difference]: Start difference. First operand has 84 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 06:16:23,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:23,500 INFO L93 Difference]: Finished difference Result 159 states and 275 transitions. [2024-11-07 06:16:23,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:16:23,502 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2024-11-07 06:16:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:23,511 INFO L225 Difference]: With dead ends: 159 [2024-11-07 06:16:23,512 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 06:16:23,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:16:23,521 INFO L432 NwaCegarLoop]: 118 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, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:23,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:16:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 06:16:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-07 06:16:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:16:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2024-11-07 06:16:23,580 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 155 [2024-11-07 06:16:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:23,582 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-07 06:16:23,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 06:16:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2024-11-07 06:16:23,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 06:16:23,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:23,588 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:23,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:16:23,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:23,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1136672876, now seen corresponding path program 1 times [2024-11-07 06:16:23,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:23,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770314933] [2024-11-07 06:16:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:23,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:16:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:16:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:16:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:16:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:16:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:16:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:16:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:16:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:16:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:16:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:16:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:16:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:16:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:16:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:16:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:16:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:16:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:16:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:16:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:16:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 06:16:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:16:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:16:24,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:24,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770314933] [2024-11-07 06:16:24,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770314933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:24,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:24,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:16:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747427480] [2024-11-07 06:16:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:24,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:16:24,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:24,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:16:24,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:16:24,039 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:16:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:24,116 INFO L93 Difference]: Finished difference Result 195 states and 292 transitions. [2024-11-07 06:16:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:16:24,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-11-07 06:16:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:24,121 INFO L225 Difference]: With dead ends: 195 [2024-11-07 06:16:24,122 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 06:16:24,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:16:24,123 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 59 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:24,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 260 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:16:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 06:16:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2024-11-07 06:16:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 78 states have internal predecessors, (100), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 06:16:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2024-11-07 06:16:24,161 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 155 [2024-11-07 06:16:24,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:24,162 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2024-11-07 06:16:24,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:16:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2024-11-07 06:16:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 06:16:24,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:24,168 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:24,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:16:24,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:24,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:24,169 INFO L85 PathProgramCache]: Analyzing trace with hash 102755879, now seen corresponding path program 1 times [2024-11-07 06:16:24,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:24,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084285860] [2024-11-07 06:16:24,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:24,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:16:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:16:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:16:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:16:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:16:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:16:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:16:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:16:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:16:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:16:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:16:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:16:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:16:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:16:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:16:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:16:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:16:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:16:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:16:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:16:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 06:16:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:16:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:16:24,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:24,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084285860] [2024-11-07 06:16:24,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084285860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:24,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:24,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:16:24,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680169723] [2024-11-07 06:16:24,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:24,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:16:24,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:24,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:16:24,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:16:24,732 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:16:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:25,017 INFO L93 Difference]: Finished difference Result 319 states and 477 transitions. [2024-11-07 06:16:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:16:25,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2024-11-07 06:16:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:25,027 INFO L225 Difference]: With dead ends: 319 [2024-11-07 06:16:25,031 INFO L226 Difference]: Without dead ends: 205 [2024-11-07 06:16:25,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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 06:16:25,035 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 79 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:25,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 326 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:16:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-07 06:16:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 162. [2024-11-07 06:16:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 99 states have internal predecessors, (121), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 06:16:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 241 transitions. [2024-11-07 06:16:25,090 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 241 transitions. Word has length 156 [2024-11-07 06:16:25,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:25,092 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 241 transitions. [2024-11-07 06:16:25,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:16:25,093 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 241 transitions. [2024-11-07 06:16:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 06:16:25,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:25,100 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:25,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:16:25,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:25,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:25,101 INFO L85 PathProgramCache]: Analyzing trace with hash -88933671, now seen corresponding path program 1 times [2024-11-07 06:16:25,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:25,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220147726] [2024-11-07 06:16:25,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:25,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:16:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:16:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:16:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:16:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:16:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:16:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:16:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:16:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:16:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:16:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:16:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:16:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:16:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:16:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:16:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:16:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:16:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:16:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:16:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:16:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 06:16:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:16:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 06:16:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:25,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220147726] [2024-11-07 06:16:25,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220147726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:16:25,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383950639] [2024-11-07 06:16:25,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:25,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:25,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:25,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:16:25,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 06:16:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:16:25,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-07 06:16:25,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 06:16:26,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383950639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:16:26,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:16:26,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 06:16:26,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386903020] [2024-11-07 06:16:26,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:16:26,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:16:26,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:26,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:16:26,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:16:26,287 INFO L87 Difference]: Start difference. First operand 162 states and 241 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:16:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:26,510 INFO L93 Difference]: Finished difference Result 246 states and 360 transitions. [2024-11-07 06:16:26,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:16:26,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 157 [2024-11-07 06:16:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:26,515 INFO L225 Difference]: With dead ends: 246 [2024-11-07 06:16:26,515 INFO L226 Difference]: Without dead ends: 132 [2024-11-07 06:16:26,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:16:26,516 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 102 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:26,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 192 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:16:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-07 06:16:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2024-11-07 06:16:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 states have internal predecessors, (90), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:16:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 182 transitions. [2024-11-07 06:16:26,552 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 182 transitions. Word has length 157 [2024-11-07 06:16:26,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:26,553 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 182 transitions. [2024-11-07 06:16:26,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:16:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 182 transitions. [2024-11-07 06:16:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 06:16:26,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:26,558 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:26,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 06:16:26,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:26,760 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:26,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash 747080274, now seen corresponding path program 1 times [2024-11-07 06:16:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:26,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54074246] [2024-11-07 06:16:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:16:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:16:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:16:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:16:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:16:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:16:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:16:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:16:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:16:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:16:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:16:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:16:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:16:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:16:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:16:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:16:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:16:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:16:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:16:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:16:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 06:16:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:16:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:16:27,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54074246] [2024-11-07 06:16:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54074246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:27,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:27,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:16:27,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520691828] [2024-11-07 06:16:27,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:27,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:16:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:27,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:16:27,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:16:27,184 INFO L87 Difference]: Start difference. First operand 128 states and 182 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:16:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:27,396 INFO L93 Difference]: Finished difference Result 305 states and 428 transitions. [2024-11-07 06:16:27,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:16:27,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2024-11-07 06:16:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:27,399 INFO L225 Difference]: With dead ends: 305 [2024-11-07 06:16:27,400 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 06:16:27,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 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 06:16:27,405 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 132 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:27,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 250 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:16:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 06:16:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 184. [2024-11-07 06:16:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 117 states have (on average 1.170940170940171) internal successors, (137), 118 states have internal predecessors, (137), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 06:16:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 257 transitions. [2024-11-07 06:16:27,455 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 257 transitions. Word has length 158 [2024-11-07 06:16:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:27,456 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 257 transitions. [2024-11-07 06:16:27,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:16:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 257 transitions. [2024-11-07 06:16:27,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 06:16:27,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:27,459 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:27,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:16:27,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:27,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash -657063986, now seen corresponding path program 1 times [2024-11-07 06:16:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:27,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124476573] [2024-11-07 06:16:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:27,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:16:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:16:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:16:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:16:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:16:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:16:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:16:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:16:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:16:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:16:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:16:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:16:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:16:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:16:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:16:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:16:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:16:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:16:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:16:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:16:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 06:16:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:16:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:16:27,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124476573] [2024-11-07 06:16:27,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124476573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:27,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:27,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:16:27,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799226863] [2024-11-07 06:16:27,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:27,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:16:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:27,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:16:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:16:27,626 INFO L87 Difference]: Start difference. First operand 184 states and 257 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:16:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:27,692 INFO L93 Difference]: Finished difference Result 276 states and 382 transitions. [2024-11-07 06:16:27,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:16:27,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2024-11-07 06:16:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:27,695 INFO L225 Difference]: With dead ends: 276 [2024-11-07 06:16:27,695 INFO L226 Difference]: Without dead ends: 148 [2024-11-07 06:16:27,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:16:27,697 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 93 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:27,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 113 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:16:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-07 06:16:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 136. [2024-11-07 06:16:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.108433734939759) internal successors, (92), 83 states have internal predecessors, (92), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:16:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 184 transitions. [2024-11-07 06:16:27,736 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 184 transitions. Word has length 158 [2024-11-07 06:16:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:27,736 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 184 transitions. [2024-11-07 06:16:27,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:16:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 184 transitions. [2024-11-07 06:16:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 06:16:27,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:27,738 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:27,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 06:16:27,739 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:27,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:27,739 INFO L85 PathProgramCache]: Analyzing trace with hash -655216944, now seen corresponding path program 1 times [2024-11-07 06:16:27,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:27,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244822956] [2024-11-07 06:16:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:16:27,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:16:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:16:27,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:16:27,979 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:16:27,980 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:16:27,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:16:27,984 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:28,137 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:16:28,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:16:28 BoogieIcfgContainer [2024-11-07 06:16:28,141 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:16:28,142 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:16:28,142 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:16:28,142 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:16:28,143 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:22" (3/4) ... [2024-11-07 06:16:28,146 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:16:28,146 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:16:28,147 INFO L158 Benchmark]: Toolchain (without parser) took 6434.26ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.4MB in the beginning and 61.7MB in the end (delta: 29.8MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. [2024-11-07 06:16:28,149 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:28,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.02ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 76.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:16:28,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.23ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:28,149 INFO L158 Benchmark]: Boogie Preprocessor took 91.78ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 71.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:28,149 INFO L158 Benchmark]: RCFGBuilder took 557.69ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 50.9MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 06:16:28,150 INFO L158 Benchmark]: TraceAbstraction took 5333.54ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 50.2MB in the beginning and 61.7MB in the end (delta: -11.5MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2024-11-07 06:16:28,150 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 159.4MB. Free memory was 61.7MB in the beginning and 61.7MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:28,151 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 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.02ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 76.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.23ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 91.78ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 71.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 557.69ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 50.9MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5333.54ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 50.2MB in the beginning and 61.7MB in the end (delta: -11.5MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 159.4MB. Free memory was 61.7MB in the beginning and 61.7MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 196, overapproximation of someBinaryArithmeticDOUBLEoperation at line 64, overapproximation of someUnaryDOUBLEoperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 196. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed short int var_1_26 = 10; [L43] signed long int var_1_34 = -10; [L44] double var_1_36 = 4.85; [L45] double var_1_38 = 15.75; [L46] signed char var_1_39 = -100; [L47] signed short int var_1_41 = -32; [L48] signed char var_1_42 = 4; [L49] signed char var_1_43 = -8; [L50] signed short int var_1_44 = -25; [L51] signed char last_1_var_1_10 = -5; [L52] signed long int last_1_var_1_21 = 1; [L53] signed long int last_1_var_1_25 = -4; VAL [isInitial=0, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L191] last_1_var_1_10 = var_1_10 [L192] last_1_var_1_21 = var_1_21 [L193] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L203] RET updateLastVariables() [L204] CALL updateVariables() [L151] var_1_3 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L152] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L153] var_1_4 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L154] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L155] var_1_7 = __VERIFIER_nondet_short() [L156] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=64, var_1_9=256] [L156] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=64, var_1_9=256] [L157] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=64, var_1_9=256] [L157] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=64, var_1_9=256] [L158] var_1_8 = __VERIFIER_nondet_short() [L159] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=256] [L159] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=256] [L160] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=256] [L160] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=256] [L161] var_1_9 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L162] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L163] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L163] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L164] var_1_11 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L165] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L166] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L166] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L167] var_1_13 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L168] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L169] var_1_14 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L170] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L171] var_1_15 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L172] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L173] var_1_16 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L174] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L175] var_1_20 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L176] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L177] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L177] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L178] var_1_22 = __VERIFIER_nondet_short() [L179] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L179] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L180] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L180] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L181] var_1_23 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L182] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L183] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L183] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L184] var_1_38 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L185] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L186] var_1_43 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_43 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L187] RET assume_abort_if_not(var_1_43 >= -126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L188] CALL assume_abort_if_not(var_1_43 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L188] RET assume_abort_if_not(var_1_43 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L204] RET updateVariables() [L205] CALL step() [L57] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L58] COND TRUE var_1_11 <= last_1_var_1_25 [L59] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L62] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L63] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L64] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=3, var_1_8=4, var_1_9=134] [L68] COND TRUE (! var_1_19) || var_1_19 [L69] var_1_44 = var_1_17 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L81] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L82] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L89] var_1_34 = ((((128) < (((((var_1_8) > ((-5 + var_1_9))) ? (var_1_8) : ((-5 + var_1_9)))))) ? (128) : (((((var_1_8) > ((-5 + var_1_9))) ? (var_1_8) : ((-5 + var_1_9))))))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L90] COND TRUE var_1_9 <= var_1_9 [L91] var_1_42 = ((((var_1_43) < 0 ) ? -(var_1_43) : (var_1_43))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L93] COND FALSE !(\read(var_1_19)) [L96] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L98] COND TRUE ! var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L99] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L102] COND FALSE !(var_1_8 >= 25) [L113] var_1_26 = var_1_8 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=4, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L117] COND FALSE !(\read(var_1_19)) [L120] var_1_36 = ((((var_1_15) > (var_1_38)) ? (var_1_15) : (var_1_38))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-100, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L122] var_1_39 = var_1_11 [L123] unsigned char stepLocal_0 = var_1_12 > var_1_12; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_0=1, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L124] COND TRUE var_1_19 || stepLocal_0 [L125] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L129] signed long int stepLocal_3 = var_1_22 + var_1_11; [L130] signed long int stepLocal_2 = (var_1_22 - var_1_23) - var_1_9; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16510, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L131] COND FALSE !(\read(var_1_20)) [L144] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16510, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=134, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L146] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16510, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=134, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=134, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=134, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=134, var_1_22=16514, var_1_23=16384, var_1_25=-4, var_1_26=4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=126, var_1_44=-5, var_1_7=3, var_1_8=4, var_1_9=134] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 479 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 1259 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 551 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 708 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 637 GetRequests, 621 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 101 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1254 NumberOfCodeBlocks, 1254 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1245 ConstructedInterpolants, 0 QuantifiedInterpolants, 2055 SizeOfPredicates, 1 NumberOfNonLiveVariables, 380 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 8033/8096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 06:16:28,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.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 fb001b1eda7dbc98350c0ec0af56acebc2e34bf2aac7fab255c878fcc02f2c5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:16:30,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:16:30,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:16:30,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:16:30,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:16:30,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:16:30,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:16:30,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:16:30,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:16:30,721 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:16:30,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:16:30,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:16:30,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:16:30,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:16:30,722 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:16:30,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:16:30,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:16:30,722 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:16:30,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:16:30,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:16:30,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:16:30,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:16:30,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:16:30,723 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:16:30,723 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:16:30,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:16:30,723 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:16:30,723 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:16:30,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:16:30,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:16:30,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:16:30,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:16:30,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:16:30,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:16:30,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:30,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:16:30,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:16:30,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:16:30,724 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:16:30,724 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:16:30,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:16:30,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:16:30,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:16:30,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:16:30,732 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 -> fb001b1eda7dbc98350c0ec0af56acebc2e34bf2aac7fab255c878fcc02f2c5f [2024-11-07 06:16:31,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:16:31,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:16:31,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:16:31,075 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:16:31,075 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:16:31,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i [2024-11-07 06:16:32,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:16:32,877 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:16:32,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i [2024-11-07 06:16:32,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e72661346/462e0c5d933e4197b62e38edf49c8b55/FLAG1ca97c5d3 [2024-11-07 06:16:32,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e72661346/462e0c5d933e4197b62e38edf49c8b55 [2024-11-07 06:16:32,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:16:32,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:16:32,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:16:32,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:16:32,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:16:32,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:16:32" (1/1) ... [2024-11-07 06:16:32,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbabf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:32, skipping insertion in model container [2024-11-07 06:16:32,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:16:32" (1/1) ... [2024-11-07 06:16:32,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:16:33,114 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i[919,932] [2024-11-07 06:16:33,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:16:33,240 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:16:33,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i[919,932] [2024-11-07 06:16:33,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:16:33,328 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:16:33,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33 WrapperNode [2024-11-07 06:16:33,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:16:33,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:16:33,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:16:33,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:16:33,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,406 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-11-07 06:16:33,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:16:33,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:16:33,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:16:33,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:16:33,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,454 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 06:16:33,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:16:33,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:16:33,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:16:33,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:16:33,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:33,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:33,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 06:16:33,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 06:16:33,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:16:33,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:16:33,582 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:16:33,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:16:33,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:16:33,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:16:33,686 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:16:33,689 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:16:39,781 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 06:16:39,782 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:16:39,793 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:16:39,793 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:16:39,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:39 BoogieIcfgContainer [2024-11-07 06:16:39,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:16:39,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:16:39,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:16:39,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:16:39,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:16:32" (1/3) ... [2024-11-07 06:16:39,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4caa0b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:16:39, skipping insertion in model container [2024-11-07 06:16:39,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (2/3) ... [2024-11-07 06:16:39,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4caa0b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:16:39, skipping insertion in model container [2024-11-07 06:16:39,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:39" (3/3) ... [2024-11-07 06:16:39,805 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i [2024-11-07 06:16:39,819 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:16:39,819 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:16:39,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:16:39,905 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;@7057495c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:16:39,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:16:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:16:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 06:16:39,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:39,923 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:39,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:39,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1304056074, now seen corresponding path program 1 times [2024-11-07 06:16:39,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:39,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196891913] [2024-11-07 06:16:39,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:39,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:39,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:39,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:39,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 06:16:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:40,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:16:40,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2024-11-07 06:16:40,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:16:40,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196891913] [2024-11-07 06:16:40,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196891913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:40,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:40,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:16:40,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583159736] [2024-11-07 06:16:40,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:40,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:16:40,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:40,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:16:40,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:16:40,654 INFO L87 Difference]: Start difference. First operand has 84 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 06:16:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:40,680 INFO L93 Difference]: Finished difference Result 159 states and 275 transitions. [2024-11-07 06:16:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:16:40,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2024-11-07 06:16:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:40,688 INFO L225 Difference]: With dead ends: 159 [2024-11-07 06:16:40,689 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 06:16:40,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:16:40,696 INFO L432 NwaCegarLoop]: 118 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, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:40,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:16:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 06:16:40,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-07 06:16:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:16:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2024-11-07 06:16:40,748 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 155 [2024-11-07 06:16:40,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:40,749 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-07 06:16:40,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 06:16:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2024-11-07 06:16:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 06:16:40,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:40,753 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:40,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 06:16:40,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:40,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:40,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:40,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1136672876, now seen corresponding path program 1 times [2024-11-07 06:16:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:40,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343795782] [2024-11-07 06:16:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:40,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:40,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:40,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:40,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 06:16:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:41,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 06:16:41,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:16:44,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:16:44,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:44,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343795782] [2024-11-07 06:16:44,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343795782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:44,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:44,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:16:44,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560420679] [2024-11-07 06:16:44,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:44,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:16:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:44,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:16:44,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:16:44,038 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:16:46,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:16:47,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:16:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:47,726 INFO L93 Difference]: Finished difference Result 229 states and 349 transitions. [2024-11-07 06:16:47,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:16:47,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-11-07 06:16:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:47,754 INFO L225 Difference]: With dead ends: 229 [2024-11-07 06:16:47,754 INFO L226 Difference]: Without dead ends: 154 [2024-11-07 06:16:47,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:16:47,756 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 73 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:47,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 328 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-07 06:16:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-07 06:16:47,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 123. [2024-11-07 06:16:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:16:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2024-11-07 06:16:47,796 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 155 [2024-11-07 06:16:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:47,797 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2024-11-07 06:16:47,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:16:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2024-11-07 06:16:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 06:16:47,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:47,802 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:47,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 06:16:48,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:48,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:48,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:48,004 INFO L85 PathProgramCache]: Analyzing trace with hash 991942010, now seen corresponding path program 1 times [2024-11-07 06:16:48,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:48,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793345168] [2024-11-07 06:16:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:48,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:48,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:48,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:48,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 06:16:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:48,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 06:16:48,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:16:52,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:16:52,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:52,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793345168] [2024-11-07 06:16:52,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793345168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:52,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:52,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:16:52,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607263885] [2024-11-07 06:16:52,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:52,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:16:52,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:52,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:16:52,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:16:52,153 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:16:53,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:16:55,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:16:58,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:00,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:17:02,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:04,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:17:10,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:17:13,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:17:15,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:17:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:17:15,790 INFO L93 Difference]: Finished difference Result 273 states and 415 transitions. [2024-11-07 06:17:15,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:17:15,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2024-11-07 06:17:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:17:15,814 INFO L225 Difference]: With dead ends: 273 [2024-11-07 06:17:15,814 INFO L226 Difference]: Without dead ends: 198 [2024-11-07 06:17:15,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:17:15,816 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 115 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:17:15,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 299 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 22.6s Time] [2024-11-07 06:17:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-07 06:17:15,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 126. [2024-11-07 06:17:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:17:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2024-11-07 06:17:15,853 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 156 [2024-11-07 06:17:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:17:15,857 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2024-11-07 06:17:15,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:17:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2024-11-07 06:17:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 06:17:15,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:15,859 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:17:15,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-07 06:17:16,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:17:16,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:16,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:16,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1002202696, now seen corresponding path program 1 times [2024-11-07 06:17:16,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:17:16,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526032773] [2024-11-07 06:17:16,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:16,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:17:16,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:17:16,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:17:16,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 06:17:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:16,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:17:16,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:17:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 39 proven. 504 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2024-11-07 06:17:18,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:17:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 39 proven. 27 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 06:17:20,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:17:20,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526032773] [2024-11-07 06:17:20,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526032773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:17:20,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:17:20,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-07 06:17:20,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659629857] [2024-11-07 06:17:20,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:17:20,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:17:20,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:17:20,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:17:20,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:17:20,042 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-07 06:17:24,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:26,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:29,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:30,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:17:31,823 INFO L93 Difference]: Finished difference Result 294 states and 432 transitions. [2024-11-07 06:17:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 06:17:31,842 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 156 [2024-11-07 06:17:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:17:31,845 INFO L225 Difference]: With dead ends: 294 [2024-11-07 06:17:31,845 INFO L226 Difference]: Without dead ends: 216 [2024-11-07 06:17:31,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2024-11-07 06:17:31,847 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 274 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:17:31,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 386 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-11-07 06:17:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-07 06:17:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 131. [2024-11-07 06:17:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 80 states have (on average 1.225) internal successors, (98), 80 states have internal predecessors, (98), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:17:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 190 transitions. [2024-11-07 06:17:31,879 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 190 transitions. Word has length 156 [2024-11-07 06:17:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:17:31,879 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 190 transitions. [2024-11-07 06:17:31,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-07 06:17:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 190 transitions. [2024-11-07 06:17:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 06:17:31,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:31,882 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:17:31,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 06:17:32,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:17:32,083 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:32,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:32,084 INFO L85 PathProgramCache]: Analyzing trace with hash 990414640, now seen corresponding path program 1 times [2024-11-07 06:17:32,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:17:32,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108190008] [2024-11-07 06:17:32,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:32,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:17:32,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:17:32,087 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:17:32,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 06:17:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:32,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:17:32,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:17:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-07 06:17:33,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:17:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 06:17:34,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:17:34,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108190008] [2024-11-07 06:17:34,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108190008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:17:34,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:17:34,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-11-07 06:17:34,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828497807] [2024-11-07 06:17:34,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:17:34,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 06:17:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:17:34,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 06:17:34,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:17:34,400 INFO L87 Difference]: Start difference. First operand 131 states and 190 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:17:38,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:17:38,324 INFO L93 Difference]: Finished difference Result 223 states and 315 transitions. [2024-11-07 06:17:38,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 06:17:38,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 157 [2024-11-07 06:17:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:17:38,354 INFO L225 Difference]: With dead ends: 223 [2024-11-07 06:17:38,354 INFO L226 Difference]: Without dead ends: 144 [2024-11-07 06:17:38,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-07 06:17:38,356 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 150 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-07 06:17:38,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 182 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-07 06:17:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-07 06:17:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2024-11-07 06:17:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 83 states have internal predecessors, (90), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:17:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2024-11-07 06:17:38,380 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 157 [2024-11-07 06:17:38,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:17:38,380 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2024-11-07 06:17:38,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:17:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2024-11-07 06:17:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:17:38,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:38,382 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:17:38,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 06:17:38,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:17:38,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:38,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:38,584 INFO L85 PathProgramCache]: Analyzing trace with hash 583599880, now seen corresponding path program 1 times [2024-11-07 06:17:38,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:17:38,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709984364] [2024-11-07 06:17:38,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:38,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:17:38,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:17:38,587 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:17:38,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 06:17:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:38,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:17:38,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:17:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-07 06:17:39,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:17:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 06:17:40,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:17:40,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709984364] [2024-11-07 06:17:40,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709984364] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:17:40,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:17:40,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-11-07 06:17:40,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882792144] [2024-11-07 06:17:40,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:17:40,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 06:17:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:17:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 06:17:40,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:17:40,866 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:17:44,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:17:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:17:45,029 INFO L93 Difference]: Finished difference Result 224 states and 296 transitions. [2024-11-07 06:17:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 06:17:45,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 159 [2024-11-07 06:17:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:17:45,059 INFO L225 Difference]: With dead ends: 224 [2024-11-07 06:17:45,059 INFO L226 Difference]: Without dead ends: 144 [2024-11-07 06:17:45,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-07 06:17:45,060 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 138 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:17:45,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 182 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-07 06:17:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-07 06:17:45,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2024-11-07 06:17:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 states have internal predecessors, (89), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:17:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2024-11-07 06:17:45,089 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 159 [2024-11-07 06:17:45,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:17:45,090 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2024-11-07 06:17:45,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:17:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2024-11-07 06:17:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:17:45,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:45,092 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:17:45,109 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 (7)] Ended with exit code 0 [2024-11-07 06:17:45,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:17:45,292 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:45,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:45,293 INFO L85 PathProgramCache]: Analyzing trace with hash -225746746, now seen corresponding path program 1 times [2024-11-07 06:17:45,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:17:45,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255100770] [2024-11-07 06:17:45,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:45,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:17:45,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:17:45,296 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:17:45,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 06:17:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:45,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 06:17:45,638 INFO L278 TraceCheckSpWp]: Computing forward predicates...