./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-53.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-pe-ci_file-53.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', 'baa8b7f2f46ebe2d8fefd26782bf4ccf337529c2f6c0fa1d354bf99fefcec55f'] 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-pe-ci_file-53.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 baa8b7f2f46ebe2d8fefd26782bf4ccf337529c2f6c0fa1d354bf99fefcec55f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:47:47,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:47:47,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:47:47,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:47:47,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:47:47,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:47:47,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:47:47,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:47:47,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:47:47,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:47:47,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:47:47,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:47:47,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:47:47,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:47:47,643 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:47:47,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:47:47,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:47:47,644 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:47:47,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:47:47,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:47:47,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:47:47,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:47:47,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:47:47,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:47:47,644 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:47:47,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:47:47,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:47:47,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:47:47,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:47:47,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:47:47,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:47:47,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:47:47,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:47:47,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:47:47,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:47:47,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:47:47,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:47:47,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:47:47,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:47:47,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:47:47,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:47:47,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:47:47,646 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 -> baa8b7f2f46ebe2d8fefd26782bf4ccf337529c2f6c0fa1d354bf99fefcec55f [2024-11-07 05:47:47,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:47:47,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:47:47,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:47:47,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:47:47,908 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:47:47,910 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-pe-ci_file-53.i [2024-11-07 05:47:49,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:47:49,428 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:47:49,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-53.i [2024-11-07 05:47:49,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5c879648/c969b1dbc9eb4587a88b5b8726597890/FLAG26ca06fec [2024-11-07 05:47:49,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5c879648/c969b1dbc9eb4587a88b5b8726597890 [2024-11-07 05:47:49,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:47:49,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:47:49,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:47:49,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:47:49,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:47:49,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:49,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5103e3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49, skipping insertion in model container [2024-11-07 05:47:49,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:49,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:47:49,850 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-pe-ci_file-53.i[919,932] [2024-11-07 05:47:49,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:47:49,908 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:47:49,916 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-pe-ci_file-53.i[919,932] [2024-11-07 05:47:49,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:47:49,974 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:47:49,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49 WrapperNode [2024-11-07 05:47:49,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:47:49,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:47:49,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:47:49,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:47:49,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:49,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:50,028 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2024-11-07 05:47:50,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:47:50,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:47:50,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:47:50,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:47:50,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:50,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:50,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:50,076 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 05:47:50,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:50,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:50,084 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:50,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:50,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:50,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:50,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:47:50,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:47:50,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:47:50,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:47:50,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (1/1) ... [2024-11-07 05:47:50,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:47:50,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:47:50,124 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 05:47:50,132 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 05:47:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:47:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:47:50,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:47:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:47:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:47:50,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:47:50,238 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:47:50,240 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:47:50,617 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-07 05:47:50,617 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:47:50,628 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:47:50,629 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:47:50,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:47:50 BoogieIcfgContainer [2024-11-07 05:47:50,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:47:50,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:47:50,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:47:50,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:47:50,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:47:49" (1/3) ... [2024-11-07 05:47:50,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4616d9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:47:50, skipping insertion in model container [2024-11-07 05:47:50,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:49" (2/3) ... [2024-11-07 05:47:50,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4616d9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:47:50, skipping insertion in model container [2024-11-07 05:47:50,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:47:50" (3/3) ... [2024-11-07 05:47:50,637 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-53.i [2024-11-07 05:47:50,648 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:47:50,649 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:47:50,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:47:50,706 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;@709c7457, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:47:50,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:47:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 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 05:47:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 05:47:50,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:50,724 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, 1] [2024-11-07 05:47:50,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:50,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:50,730 INFO L85 PathProgramCache]: Analyzing trace with hash -163625204, now seen corresponding path program 1 times [2024-11-07 05:47:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:50,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660359871] [2024-11-07 05:47:50,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:50,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:47:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:47:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:47:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:47:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:47:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 05:47:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:47:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:47:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:47:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:47:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:47:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:47:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:47:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:47:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:47:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:47:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:47:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:47:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:47:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:47:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:47:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:47:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:47:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,082 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 05:47:51,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:47:51,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660359871] [2024-11-07 05:47:51,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660359871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:51,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:51,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:47:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440526849] [2024-11-07 05:47:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:51,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:47:51,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:47:51,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:47:51,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:47:51,102 INFO L87 Difference]: Start difference. First operand has 99 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 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 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 05:47:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:51,125 INFO L93 Difference]: Finished difference Result 191 states and 325 transitions. [2024-11-07 05:47:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:47:51,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 160 [2024-11-07 05:47:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:51,132 INFO L225 Difference]: With dead ends: 191 [2024-11-07 05:47:51,132 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 05:47:51,135 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 05:47:51,137 INFO L432 NwaCegarLoop]: 146 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, 146 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 05:47:51,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:47:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 05:47:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-07 05:47:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 70 states have internal predecessors, (100), 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 05:47:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 146 transitions. [2024-11-07 05:47:51,176 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 146 transitions. Word has length 160 [2024-11-07 05:47:51,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:51,176 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 146 transitions. [2024-11-07 05:47:51,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 05:47:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 146 transitions. [2024-11-07 05:47:51,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 05:47:51,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:51,179 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, 1] [2024-11-07 05:47:51,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:47:51,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:51,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:51,180 INFO L85 PathProgramCache]: Analyzing trace with hash 742096838, now seen corresponding path program 1 times [2024-11-07 05:47:51,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:51,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718218175] [2024-11-07 05:47:51,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:51,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:47:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:47:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:47:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:47:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:47:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 05:47:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:47:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:47:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:47:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:47:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:47:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:47:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:47:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:47:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:47:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:47:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:47:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:47:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:47:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:47:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:47:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:47:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:47:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,490 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 05:47:51,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:47:51,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718218175] [2024-11-07 05:47:51,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718218175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:51,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:51,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:47:51,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289757332] [2024-11-07 05:47:51,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:51,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:47:51,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:47:51,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:47:51,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:47:51,493 INFO L87 Difference]: Start difference. First operand 95 states and 146 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 05:47:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:51,602 INFO L93 Difference]: Finished difference Result 268 states and 413 transitions. [2024-11-07 05:47:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:47:51,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 160 [2024-11-07 05:47:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:51,604 INFO L225 Difference]: With dead ends: 268 [2024-11-07 05:47:51,604 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 05:47:51,605 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 05:47:51,606 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 119 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:51,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 345 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:47:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 05:47:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2024-11-07 05:47:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 125 states have (on average 1.368) internal successors, (171), 125 states have internal predecessors, (171), 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 05:47:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 263 transitions. [2024-11-07 05:47:51,646 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 263 transitions. Word has length 160 [2024-11-07 05:47:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:51,648 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 263 transitions. [2024-11-07 05:47:51,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 05:47:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2024-11-07 05:47:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 05:47:51,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:51,673 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, 1, 1, 1] [2024-11-07 05:47:51,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:47:51,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:51,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:51,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1492214870, now seen corresponding path program 1 times [2024-11-07 05:47:51,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:51,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815343049] [2024-11-07 05:47:51,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:47:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:47:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:47:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:47:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:47:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 05:47:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:47:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:47:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:47:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:47:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:47:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:47:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:47:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:47:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:47:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:47:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:47:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:47:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:47:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:47:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:47:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:47:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:47:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:51,866 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 05:47:51,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:47:51,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815343049] [2024-11-07 05:47:51,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815343049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:51,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:51,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:47:51,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383664818] [2024-11-07 05:47:51,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:51,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:47:51,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:47:51,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:47:51,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:47:51,868 INFO L87 Difference]: Start difference. First operand 174 states and 263 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 05:47:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:51,915 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2024-11-07 05:47:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:47:51,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 162 [2024-11-07 05:47:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:51,918 INFO L225 Difference]: With dead ends: 355 [2024-11-07 05:47:51,918 INFO L226 Difference]: Without dead ends: 184 [2024-11-07 05:47:51,919 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 05:47:51,919 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 124 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:51,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 254 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:47:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-07 05:47:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2024-11-07 05:47:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 133 states have (on average 1.3383458646616542) internal successors, (178), 133 states have internal predecessors, (178), 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 05:47:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 270 transitions. [2024-11-07 05:47:51,940 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 270 transitions. Word has length 162 [2024-11-07 05:47:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:51,941 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 270 transitions. [2024-11-07 05:47:51,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 05:47:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 270 transitions. [2024-11-07 05:47:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 05:47:51,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:51,943 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, 1, 1, 1] [2024-11-07 05:47:51,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:47:51,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:51,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:51,943 INFO L85 PathProgramCache]: Analyzing trace with hash 905408856, now seen corresponding path program 1 times [2024-11-07 05:47:51,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:51,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776264246] [2024-11-07 05:47:51,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:51,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:47:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:47:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:47:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:47:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:47:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 05:47:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:47:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:47:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:47:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:47:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:47:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:47:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:47:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:47:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:47:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:47:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:47:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:47:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:47:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:47:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:47:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:47:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:47:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,303 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 05:47:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:47:52,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776264246] [2024-11-07 05:47:52,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776264246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:52,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:52,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:47:52,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923671371] [2024-11-07 05:47:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:52,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:47:52,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:47:52,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:47:52,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:47:52,306 INFO L87 Difference]: Start difference. First operand 182 states and 270 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 05:47:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:52,536 INFO L93 Difference]: Finished difference Result 621 states and 919 transitions. [2024-11-07 05:47:52,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:47:52,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 162 [2024-11-07 05:47:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:52,542 INFO L225 Difference]: With dead ends: 621 [2024-11-07 05:47:52,543 INFO L226 Difference]: Without dead ends: 442 [2024-11-07 05:47:52,544 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 05:47:52,544 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 172 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:52,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 434 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:47:52,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-07 05:47:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 424. [2024-11-07 05:47:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 327 states have (on average 1.3547400611620795) internal successors, (443), 327 states have internal predecessors, (443), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-07 05:47:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 627 transitions. [2024-11-07 05:47:52,597 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 627 transitions. Word has length 162 [2024-11-07 05:47:52,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:52,597 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 627 transitions. [2024-11-07 05:47:52,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 05:47:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 627 transitions. [2024-11-07 05:47:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 05:47:52,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:52,599 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, 1, 1, 1, 1] [2024-11-07 05:47:52,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:47:52,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:52,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:52,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1597730895, now seen corresponding path program 1 times [2024-11-07 05:47:52,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:52,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690057461] [2024-11-07 05:47:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:47:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:47:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:47:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:47:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:47:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 05:47:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:47:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:47:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:47:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:47:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:47:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:47:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:47:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:47:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:47:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:47:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:47:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:47:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:47:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:47:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:47:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:47:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:47:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:53,001 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 05:47:53,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:47:53,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690057461] [2024-11-07 05:47:53,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690057461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:47:53,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190312235] [2024-11-07 05:47:53,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:53,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:47:53,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:47:53,008 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 05:47:53,009 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 05:47:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:53,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 05:47:53,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:47:53,562 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 05:47:53,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:47:53,886 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 05:47:53,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190312235] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:47:53,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:47:53,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 20 [2024-11-07 05:47:53,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267972685] [2024-11-07 05:47:53,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:47:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 05:47:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:47:53,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 05:47:53,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-11-07 05:47:53,889 INFO L87 Difference]: Start difference. First operand 424 states and 627 transitions. Second operand has 20 states, 20 states have (on average 5.05) internal successors, (101), 20 states have internal predecessors, (101), 5 states have call successors, (53), 3 states have call predecessors, (53), 6 states have return successors, (54), 5 states have call predecessors, (54), 5 states have call successors, (54) [2024-11-07 05:47:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:55,770 INFO L93 Difference]: Finished difference Result 1222 states and 1763 transitions. [2024-11-07 05:47:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-07 05:47:55,770 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.05) internal successors, (101), 20 states have internal predecessors, (101), 5 states have call successors, (53), 3 states have call predecessors, (53), 6 states have return successors, (54), 5 states have call predecessors, (54), 5 states have call successors, (54) Word has length 163 [2024-11-07 05:47:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:55,774 INFO L225 Difference]: With dead ends: 1222 [2024-11-07 05:47:55,774 INFO L226 Difference]: Without dead ends: 801 [2024-11-07 05:47:55,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 362 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=739, Invalid=2683, Unknown=0, NotChecked=0, Total=3422 [2024-11-07 05:47:55,776 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 926 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:55,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 2301 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 05:47:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-07 05:47:55,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 446. [2024-11-07 05:47:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 345 states have (on average 1.336231884057971) internal successors, (461), 345 states have internal predecessors, (461), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-07 05:47:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 645 transitions. [2024-11-07 05:47:55,818 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 645 transitions. Word has length 163 [2024-11-07 05:47:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:55,819 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 645 transitions. [2024-11-07 05:47:55,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.05) internal successors, (101), 20 states have internal predecessors, (101), 5 states have call successors, (53), 3 states have call predecessors, (53), 6 states have return successors, (54), 5 states have call predecessors, (54), 5 states have call successors, (54) [2024-11-07 05:47:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 645 transitions. [2024-11-07 05:47:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 05:47:55,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:55,820 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, 1, 1, 1, 1] [2024-11-07 05:47:55,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 05:47:56,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:47:56,025 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:56,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1879587951, now seen corresponding path program 1 times [2024-11-07 05:47:56,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:56,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385086052] [2024-11-07 05:47:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:56,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:47:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:47:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:47:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:47:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:47:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 05:47:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:47:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:47:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:47:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:47:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:47:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:47:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:47:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:47:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:47:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:47:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:47:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:47:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:47:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:47:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:47:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:47:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:47:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:56,157 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 05:47:56,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:47:56,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385086052] [2024-11-07 05:47:56,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385086052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:56,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:56,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:47:56,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680011763] [2024-11-07 05:47:56,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:56,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:47:56,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:47:56,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:47:56,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:47:56,159 INFO L87 Difference]: Start difference. First operand 446 states and 645 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 05:47:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:56,262 INFO L93 Difference]: Finished difference Result 1114 states and 1614 transitions. [2024-11-07 05:47:56,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:47:56,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 163 [2024-11-07 05:47:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:56,266 INFO L225 Difference]: With dead ends: 1114 [2024-11-07 05:47:56,267 INFO L226 Difference]: Without dead ends: 671 [2024-11-07 05:47:56,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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 05:47:56,269 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 130 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:56,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 369 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:47:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-11-07 05:47:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 440. [2024-11-07 05:47:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 339 states have (on average 1.3333333333333333) internal successors, (452), 339 states have internal predecessors, (452), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-07 05:47:56,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 636 transitions. [2024-11-07 05:47:56,332 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 636 transitions. Word has length 163 [2024-11-07 05:47:56,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:56,333 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 636 transitions. [2024-11-07 05:47:56,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 05:47:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 636 transitions. [2024-11-07 05:47:56,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 05:47:56,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:56,335 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, 1, 1, 1, 1, 1] [2024-11-07 05:47:56,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 05:47:56,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:56,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:56,335 INFO L85 PathProgramCache]: Analyzing trace with hash -361906070, now seen corresponding path program 1 times [2024-11-07 05:47:56,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:56,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343029675] [2024-11-07 05:47:56,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:56,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:47:56,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825340289] [2024-11-07 05:47:56,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:56,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:47:56,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:47:56,424 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:47:56,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 05:47:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:47:56,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:47:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:47:56,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:47:56,822 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:47:56,823 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:47:56,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 05:47:57,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:47:57,028 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:47:57,125 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:47:57,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:47:57 BoogieIcfgContainer [2024-11-07 05:47:57,133 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:47:57,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:47:57,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:47:57,133 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:47:57,134 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:47:50" (3/4) ... [2024-11-07 05:47:57,136 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:47:57,137 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:47:57,139 INFO L158 Benchmark]: Toolchain (without parser) took 7397.12ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 116.4MB in the beginning and 77.6MB in the end (delta: 38.8MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. [2024-11-07 05:47:57,139 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 81.5MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:47:57,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.33ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 100.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:47:57,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.09ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 96.6MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:47:57,140 INFO L158 Benchmark]: Boogie Preprocessor took 63.59ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 91.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:47:57,140 INFO L158 Benchmark]: RCFGBuilder took 535.38ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 63.9MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 05:47:57,140 INFO L158 Benchmark]: TraceAbstraction took 6501.73ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 63.2MB in the beginning and 77.7MB in the end (delta: -14.4MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-11-07 05:47:57,141 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 184.5MB. Free memory was 77.7MB in the beginning and 77.6MB in the end (delta: 55.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:47:57,142 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.29ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 81.5MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.33ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 100.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.09ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 96.6MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.59ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 91.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 535.38ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 63.9MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6501.73ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 63.2MB in the beginning and 77.7MB in the end (delta: -14.4MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 184.5MB. Free memory was 77.7MB in the beginning and 77.6MB in the end (delta: 55.4kB). 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 187, overapproximation of shiftLeft at line 67, overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of someUnaryFLOAToperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] signed short int var_1_24 = 2; [L40] unsigned short int var_1_31 = 8; [L41] unsigned char var_1_33 = 1; [L42] float var_1_35 = 32.4; [L43] float var_1_36 = 8.5; [L44] float var_1_37 = 7.5; [L45] unsigned char var_1_39 = 16; [L46] signed short int var_1_41 = -2; [L47] unsigned char var_1_42 = 10; [L48] unsigned char var_1_43 = 4; [L49] unsigned char var_1_44 = 64; [L50] signed long int var_1_45 = -25; [L51] unsigned char last_1_var_1_1 = 0; [L52] unsigned long int last_1_var_1_9 = 10; [L53] signed short int last_1_var_1_14 = 32; [L54] unsigned char last_1_var_1_16 = 1; [L55] signed char last_1_var_1_20 = 1; VAL [isInitial=0, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=0, var_1_9=10] [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L180] last_1_var_1_1 = var_1_1 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_14 = var_1_14 [L183] last_1_var_1_16 = var_1_16 [L184] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=0, var_1_9=10] [L194] RET updateLastVariables() [L195] CALL updateVariables() [L142] var_1_8 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L143] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L144] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L144] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L145] var_1_11 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L146] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L147] var_1_12 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L148] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L149] var_1_13 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L150] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L151] var_1_15 = __VERIFIER_nondet_ulong() [L152] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L152] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L153] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L153] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L154] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L154] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L155] var_1_17 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L156] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L157] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L157] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L158] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L159] var_1_18 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L160] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L161] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L161] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L162] var_1_19 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L163] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L164] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L164] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L165] var_1_21 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L166] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L167] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L167] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L168] var_1_36 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L169] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L170] var_1_37 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L171] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L172] var_1_43 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L173] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L174] CALL assume_abort_if_not(var_1_43 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L174] RET assume_abort_if_not(var_1_43 <= 127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L175] var_1_44 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L176] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L177] CALL assume_abort_if_not(var_1_44 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L177] RET assume_abort_if_not(var_1_44 <= 127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L195] RET updateVariables() [L196] CALL step() [L59] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L60] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L61] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L66] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=1, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L67] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=1, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L67] COND TRUE stepLocal_6 <= (256u << last_1_var_1_16) [L68] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L70] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L71] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L72] COND TRUE (! var_1_1) || stepLocal_4 [L73] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L81] var_1_20 = var_1_21 [L82] var_1_22 = var_1_12 [L83] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L84] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L87] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L87] COND FALSE !(((var_1_16 / var_1_15) & var_1_16) >= var_1_20) [L90] var_1_14 = -128 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L93] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L94] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L95] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L96] COND TRUE stepLocal_2 <= (-5 + var_1_16) [L97] var_1_9 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L100] COND FALSE !(\read(var_1_1)) [L107] var_1_24 = var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L109] COND FALSE !(var_1_20 >= var_1_16) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L116] var_1_33 = var_1_8 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L117] COND TRUE var_1_16 >= var_1_16 [L118] var_1_35 = ((var_1_36 - var_1_37) + var_1_12) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L120] COND FALSE !(var_1_1 || var_1_1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L123] COND TRUE \read(var_1_8) [L124] var_1_41 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_39=16, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L128] COND TRUE var_1_13 <= ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) [L129] var_1_42 = (((((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))) < 0 ) ? -((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))) : ((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_39=16, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L131] COND FALSE !((var_1_16 / var_1_15) >= var_1_19) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_39=16, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L136] COND TRUE ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) < (var_1_12 * var_1_11) [L137] var_1_45 = 4 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_39=16, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=5] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_39=16, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=5] [L187] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_39=16, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=5] [L187-L188] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_39=16, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=6, var_1_16=5, var_1_17=10, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=1, var_1_22=3, var_1_23=1, var_1_24=1, var_1_31=8, var_1_33=1, var_1_39=16, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 7, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1473 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1471 mSDsluCounter, 3849 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2574 mSDsCounter, 585 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1907 IncrementalHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 585 mSolverCounterUnsat, 1275 mSDtfsCounter, 1907 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 691 GetRequests, 626 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=5, InterpolantAutomatonStates: 58, 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, 608 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1461 NumberOfCodeBlocks, 1461 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1288 ConstructedInterpolants, 0 QuantifiedInterpolants, 2359 SizeOfPredicates, 5 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 15 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 05:47:57,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-53.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 baa8b7f2f46ebe2d8fefd26782bf4ccf337529c2f6c0fa1d354bf99fefcec55f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:47:59,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:47:59,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 05:47:59,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:47:59,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:47:59,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:47:59,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:47:59,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:47:59,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:47:59,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:47:59,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:47:59,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:47:59,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:47:59,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:47:59,524 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:47:59,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:47:59,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:47:59,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:47:59,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:47:59,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:47:59,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:47:59,526 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:47:59,526 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:47:59,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:47:59,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:47:59,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:47:59,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:47:59,526 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 -> baa8b7f2f46ebe2d8fefd26782bf4ccf337529c2f6c0fa1d354bf99fefcec55f [2024-11-07 05:47:59,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:47:59,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:47:59,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:47:59,796 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:47:59,796 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:47:59,798 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-pe-ci_file-53.i [2024-11-07 05:48:01,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:48:01,553 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:48:01,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-53.i [2024-11-07 05:48:01,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7940532d7/0bfede2ffe144a1f82d81a1f4f2549f7/FLAG27c86c247 [2024-11-07 05:48:01,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7940532d7/0bfede2ffe144a1f82d81a1f4f2549f7 [2024-11-07 05:48:01,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:48:01,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:48:01,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:48:01,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:48:01,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:48:01,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:48:01" (1/1) ... [2024-11-07 05:48:01,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bbe6af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:01, skipping insertion in model container [2024-11-07 05:48:01,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:48:01" (1/1) ... [2024-11-07 05:48:01,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:48:02,014 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-pe-ci_file-53.i[919,932] [2024-11-07 05:48:02,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:48:02,089 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:48:02,097 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-pe-ci_file-53.i[919,932] [2024-11-07 05:48:02,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:48:02,156 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:48:02,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02 WrapperNode [2024-11-07 05:48:02,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:48:02,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:48:02,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:48:02,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:48:02,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (1/1) ... [2024-11-07 05:48:02,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (1/1) ... [2024-11-07 05:48:02,198 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-11-07 05:48:02,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:48:02,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:48:02,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:48:02,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:48:02,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (1/1) ... [2024-11-07 05:48:02,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (1/1) ... [2024-11-07 05:48:02,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (1/1) ... [2024-11-07 05:48:02,218 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 05:48:02,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (1/1) ... [2024-11-07 05:48:02,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (1/1) ... [2024-11-07 05:48:02,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (1/1) ... [2024-11-07 05:48:02,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (1/1) ... [2024-11-07 05:48:02,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (1/1) ... [2024-11-07 05:48:02,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (1/1) ... [2024-11-07 05:48:02,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:48:02,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:48:02,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:48:02,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:48:02,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (1/1) ... [2024-11-07 05:48:02,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:48:02,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:02,273 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 05:48:02,275 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 05:48:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:48:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:48:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:48:02,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:48:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:48:02,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:48:02,374 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:48:02,375 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:48:03,800 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-07 05:48:03,800 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:48:03,807 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:48:03,807 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:48:03,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:03 BoogieIcfgContainer [2024-11-07 05:48:03,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:48:03,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:48:03,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:48:03,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:48:03,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:48:01" (1/3) ... [2024-11-07 05:48:03,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c28bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:48:03, skipping insertion in model container [2024-11-07 05:48:03,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:02" (2/3) ... [2024-11-07 05:48:03,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c28bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:48:03, skipping insertion in model container [2024-11-07 05:48:03,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:03" (3/3) ... [2024-11-07 05:48:03,814 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-53.i [2024-11-07 05:48:03,823 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:48:03,823 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:48:03,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:48:03,871 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;@63999250, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:48:03,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:48:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 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 05:48:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 05:48:03,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:03,883 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 05:48:03,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:03,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:03,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1163910123, now seen corresponding path program 1 times [2024-11-07 05:48:03,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:48:03,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291787871] [2024-11-07 05:48:03,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:03,895 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 05:48:03,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:48:03,897 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 05:48:03,901 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 05:48:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:04,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:48:04,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2024-11-07 05:48:04,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:48:04,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:48:04,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291787871] [2024-11-07 05:48:04,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291787871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:04,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:04,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:48:04,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543512133] [2024-11-07 05:48:04,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:04,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:48:04,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:48:04,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:48:04,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:48:04,224 INFO L87 Difference]: Start difference. First operand has 81 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 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 05:48:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:04,243 INFO L93 Difference]: Finished difference Result 155 states and 271 transitions. [2024-11-07 05:48:04,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:48:04,244 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 05:48:04,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:04,249 INFO L225 Difference]: With dead ends: 155 [2024-11-07 05:48:04,249 INFO L226 Difference]: Without dead ends: 77 [2024-11-07 05:48:04,252 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 05:48:04,254 INFO L432 NwaCegarLoop]: 119 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, 119 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 05:48:04,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:48:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-07 05:48:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-07 05:48:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 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 05:48:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 119 transitions. [2024-11-07 05:48:04,292 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 119 transitions. Word has length 155 [2024-11-07 05:48:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:04,293 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 119 transitions. [2024-11-07 05:48:04,293 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 05:48:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 119 transitions. [2024-11-07 05:48:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 05:48:04,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:04,296 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 05:48:04,307 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 05:48:04,496 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 05:48:04,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:04,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:04,497 INFO L85 PathProgramCache]: Analyzing trace with hash 627750067, now seen corresponding path program 1 times [2024-11-07 05:48:04,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:48:04,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714199527] [2024-11-07 05:48:04,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:04,500 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 05:48:04,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:48:04,503 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 05:48:04,505 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 05:48:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:04,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 05:48:04,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:05,164 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 05:48:05,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:48:05,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:48:05,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714199527] [2024-11-07 05:48:05,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714199527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:05,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:05,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:48:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285263513] [2024-11-07 05:48:05,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:05,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:48:05,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:48:05,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:48:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:05,175 INFO L87 Difference]: Start difference. First operand 77 states and 119 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 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 05:48:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:05,481 INFO L93 Difference]: Finished difference Result 221 states and 343 transitions. [2024-11-07 05:48:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:48:05,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 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 05:48:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:05,484 INFO L225 Difference]: With dead ends: 221 [2024-11-07 05:48:05,484 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 05:48:05,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 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 05:48:05,485 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 34 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:05,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 215 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:48:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 05:48:05,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-11-07 05:48:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 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 05:48:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 222 transitions. [2024-11-07 05:48:05,505 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 222 transitions. Word has length 155 [2024-11-07 05:48:05,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:05,505 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 222 transitions. [2024-11-07 05:48:05,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 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 05:48:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 222 transitions. [2024-11-07 05:48:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 05:48:05,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:05,507 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 05:48:05,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 05:48:05,708 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 05:48:05,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:05,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash 447441449, now seen corresponding path program 1 times [2024-11-07 05:48:05,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:48:05,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747060294] [2024-11-07 05:48:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:05,709 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 05:48:05,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:48:05,712 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 05:48:05,713 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 05:48:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:05,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 05:48:05,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:06,699 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 05:48:06,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:48:06,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:48:06,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747060294] [2024-11-07 05:48:06,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747060294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:06,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:06,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:48:06,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143687544] [2024-11-07 05:48:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:06,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:48:06,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:48:06,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:48:06,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:48:06,700 INFO L87 Difference]: Start difference. First operand 145 states and 222 transitions. Second operand has 5 states, 5 states have (on average 8.8) 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 05:48:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:07,224 INFO L93 Difference]: Finished difference Result 358 states and 546 transitions. [2024-11-07 05:48:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:48:07,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) 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 05:48:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:07,238 INFO L225 Difference]: With dead ends: 358 [2024-11-07 05:48:07,240 INFO L226 Difference]: Without dead ends: 216 [2024-11-07 05:48:07,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:48:07,242 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 66 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:07,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 396 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 05:48:07,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-07 05:48:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 188. [2024-11-07 05:48:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 115 states have (on average 1.2956521739130435) internal successors, (149), 115 states have internal predecessors, (149), 69 states have call successors, (69), 3 states have call predecessors, (69), 3 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 05:48:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 287 transitions. [2024-11-07 05:48:07,275 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 287 transitions. Word has length 156 [2024-11-07 05:48:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:07,277 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 287 transitions. [2024-11-07 05:48:07,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) 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 05:48:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 287 transitions. [2024-11-07 05:48:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 05:48:07,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:07,281 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 05:48:07,293 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 05:48:07,481 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 05:48:07,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:07,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash 729631811, now seen corresponding path program 1 times [2024-11-07 05:48:07,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:48:07,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674159567] [2024-11-07 05:48:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:07,487 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 05:48:07,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:48:07,489 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 05:48:07,491 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 05:48:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:07,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 05:48:07,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:07,776 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 05:48:07,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:48:07,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:48:07,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674159567] [2024-11-07 05:48:07,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674159567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:07,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:07,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:48:07,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210253412] [2024-11-07 05:48:07,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:07,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:48:07,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:48:07,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:48:07,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:07,779 INFO L87 Difference]: Start difference. First operand 188 states and 287 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) 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 05:48:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:08,478 INFO L93 Difference]: Finished difference Result 408 states and 623 transitions. [2024-11-07 05:48:08,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:48:08,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) 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 05:48:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:08,485 INFO L225 Difference]: With dead ends: 408 [2024-11-07 05:48:08,485 INFO L226 Difference]: Without dead ends: 266 [2024-11-07 05:48:08,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 154 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 05:48:08,487 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 104 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:08,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 310 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 05:48:08,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-07 05:48:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 190. [2024-11-07 05:48:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 117 states have (on average 1.2905982905982907) internal successors, (151), 117 states have internal predecessors, (151), 69 states have call successors, (69), 3 states have call predecessors, (69), 3 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 05:48:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 289 transitions. [2024-11-07 05:48:08,555 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 289 transitions. Word has length 156 [2024-11-07 05:48:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:08,555 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 289 transitions. [2024-11-07 05:48:08,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) 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 05:48:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 289 transitions. [2024-11-07 05:48:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 05:48:08,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:08,561 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 05:48:08,572 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 05:48:08,761 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 05:48:08,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:08,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash -291436543, now seen corresponding path program 1 times [2024-11-07 05:48:08,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:48:08,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879925102] [2024-11-07 05:48:08,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:08,762 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 05:48:08,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:48:08,768 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 05:48:08,769 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 05:48:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:08,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 05:48:09,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:09,145 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 05:48:09,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:48:09,350 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 05:48:09,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:48:09,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879925102] [2024-11-07 05:48:09,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879925102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:48:09,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:48:09,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-07 05:48:09,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108170300] [2024-11-07 05:48:09,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:48:09,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 05:48:09,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:48:09,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 05:48:09,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:48:09,352 INFO L87 Difference]: Start difference. First operand 190 states and 289 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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 05:48:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:11,317 INFO L93 Difference]: Finished difference Result 439 states and 650 transitions. [2024-11-07 05:48:11,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 05:48:11,326 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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 156 [2024-11-07 05:48:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:11,328 INFO L225 Difference]: With dead ends: 439 [2024-11-07 05:48:11,328 INFO L226 Difference]: Without dead ends: 295 [2024-11-07 05:48:11,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2024-11-07 05:48:11,337 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 332 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:11,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 802 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 05:48:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-07 05:48:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 200. [2024-11-07 05:48:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 124 states have internal predecessors, (157), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 05:48:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 295 transitions. [2024-11-07 05:48:11,372 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 295 transitions. Word has length 156 [2024-11-07 05:48:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:11,372 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 295 transitions. [2024-11-07 05:48:11,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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 05:48:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 295 transitions. [2024-11-07 05:48:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 05:48:11,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:11,377 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 05:48:11,387 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 05:48:11,578 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 05:48:11,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:11,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:11,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2007249257, now seen corresponding path program 1 times [2024-11-07 05:48:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:48:11,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269694180] [2024-11-07 05:48:11,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:11,580 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 05:48:11,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:48:11,582 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 05:48:11,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 05:48:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 05:48:11,816 INFO L278 TraceCheckSpWp]: Computing forward predicates...