./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.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-62.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', 'd2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724'] 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-62.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 d2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:48:39,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:48:40,054 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:48:40,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:48:40,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:48:40,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:48:40,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:48:40,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:48:40,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:48:40,091 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:48:40,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:48:40,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:48:40,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:48:40,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:48:40,093 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:48:40,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:48:40,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:48:40,094 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:48:40,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:48:40,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:48:40,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:48:40,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:48:40,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:48:40,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:48:40,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:48:40,095 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:48:40,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:48:40,095 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:48:40,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:48:40,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:48:40,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:48:40,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:48:40,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:48:40,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:48:40,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:48:40,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:48:40,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:48:40,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:48:40,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:48:40,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:48:40,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:48:40,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:48:40,098 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 -> d2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724 [2024-11-07 05:48:40,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:48:40,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:48:40,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:48:40,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:48:40,402 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:48:40,403 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-62.i [2024-11-07 05:48:41,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:48:41,928 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:48:41,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-11-07 05:48:41,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8645e717d/67f3081a9dcb4bbb9065bc6e20cf6914/FLAGb77e3a2a2 [2024-11-07 05:48:41,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8645e717d/67f3081a9dcb4bbb9065bc6e20cf6914 [2024-11-07 05:48:41,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:48:41,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:48:41,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:48:41,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:48:41,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:48:41,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:48:41" (1/1) ... [2024-11-07 05:48:41,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71089686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:41, skipping insertion in model container [2024-11-07 05:48:41,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:48:41" (1/1) ... [2024-11-07 05:48:41,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:48:42,120 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-62.i[919,932] [2024-11-07 05:48:42,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:48:42,234 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:48:42,244 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-62.i[919,932] [2024-11-07 05:48:42,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:48:42,311 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:48:42,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:42 WrapperNode [2024-11-07 05:48:42,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:48:42,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:48:42,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:48:42,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:48:42,320 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:42" (1/1) ... [2024-11-07 05:48:42,331 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:42" (1/1) ... [2024-11-07 05:48:42,378 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-11-07 05:48:42,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:48:42,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:48:42,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:48:42,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:48:42,391 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:42" (1/1) ... [2024-11-07 05:48:42,391 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:42" (1/1) ... [2024-11-07 05:48:42,395 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:42" (1/1) ... [2024-11-07 05:48:42,410 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:42,410 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:42" (1/1) ... [2024-11-07 05:48:42,410 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:42" (1/1) ... [2024-11-07 05:48:42,419 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:42" (1/1) ... [2024-11-07 05:48:42,423 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:42" (1/1) ... [2024-11-07 05:48:42,427 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:42" (1/1) ... [2024-11-07 05:48:42,438 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:42" (1/1) ... [2024-11-07 05:48:42,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:48:42,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:48:42,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:48:42,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:48:42,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:42" (1/1) ... [2024-11-07 05:48:42,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:48:42,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:42,484 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:42,487 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:42,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:48:42,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:48:42,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:48:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:48:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:48:42,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:48:42,626 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:48:42,629 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:48:43,080 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 05:48:43,081 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:48:43,094 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:48:43,095 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:48:43,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:43 BoogieIcfgContainer [2024-11-07 05:48:43,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:48:43,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:48:43,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:48:43,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:48:43,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:48:41" (1/3) ... [2024-11-07 05:48:43,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bed0cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:48:43, skipping insertion in model container [2024-11-07 05:48:43,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:42" (2/3) ... [2024-11-07 05:48:43,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bed0cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:48:43, skipping insertion in model container [2024-11-07 05:48:43,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:43" (3/3) ... [2024-11-07 05:48:43,105 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-11-07 05:48:43,119 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:48:43,120 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:48:43,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:48:43,185 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;@6a76366a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:48:43,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:48:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 05:48:43,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 05:48:43,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:43,212 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:43,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:43,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1604698210, now seen corresponding path program 1 times [2024-11-07 05:48:43,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:43,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781313653] [2024-11-07 05:48:43,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:43,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:48:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:48:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 05:48:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:48:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:48:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:48:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:48:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:48:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:48:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:48:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:48:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 05:48:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 05:48:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:48:43,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:43,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781313653] [2024-11-07 05:48:43,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781313653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:43,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:43,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:48:43,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881554873] [2024-11-07 05:48:43,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:43,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:48:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:43,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:48:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:48:43,650 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 05:48:43,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:43,684 INFO L93 Difference]: Finished difference Result 187 states and 329 transitions. [2024-11-07 05:48:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:48:43,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 191 [2024-11-07 05:48:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:43,694 INFO L225 Difference]: With dead ends: 187 [2024-11-07 05:48:43,694 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 05:48:43,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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:43,703 INFO L432 NwaCegarLoop]: 137 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, 137 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:43,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 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:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 05:48:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 05:48:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 05:48:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 137 transitions. [2024-11-07 05:48:43,756 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 137 transitions. Word has length 191 [2024-11-07 05:48:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:43,757 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 137 transitions. [2024-11-07 05:48:43,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 05:48:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 137 transitions. [2024-11-07 05:48:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 05:48:43,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:43,762 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:48:43,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:43,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash 402394394, now seen corresponding path program 1 times [2024-11-07 05:48:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:43,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2389372] [2024-11-07 05:48:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:48:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:48:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 05:48:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:48:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:48:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:48:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:48:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:48:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:48:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:48:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:48:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 05:48:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 05:48:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:48:44,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2389372] [2024-11-07 05:48:44,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2389372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:44,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:44,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:48:44,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890669637] [2024-11-07 05:48:44,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:44,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:48:44,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:44,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:48:44,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:44,262 INFO L87 Difference]: Start difference. First operand 91 states and 137 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:48:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:44,377 INFO L93 Difference]: Finished difference Result 230 states and 345 transitions. [2024-11-07 05:48:44,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:48:44,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-07 05:48:44,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:44,384 INFO L225 Difference]: With dead ends: 230 [2024-11-07 05:48:44,384 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 05:48:44,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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:44,386 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 54 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:44,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 278 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:48:44,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 05:48:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-07 05:48:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 98 states have (on average 1.316326530612245) internal successors, (129), 99 states have internal predecessors, (129), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 05:48:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 205 transitions. [2024-11-07 05:48:44,414 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 205 transitions. Word has length 191 [2024-11-07 05:48:44,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:44,415 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 205 transitions. [2024-11-07 05:48:44,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:48:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 205 transitions. [2024-11-07 05:48:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 05:48:44,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:44,418 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:48:44,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:44,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash -406952232, now seen corresponding path program 1 times [2024-11-07 05:48:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:44,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511457639] [2024-11-07 05:48:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:44,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:48:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:48:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 05:48:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:48:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:48:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:48:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:48:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:48:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:48:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:48:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:48:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 05:48:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 05:48:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:48:44,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:44,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511457639] [2024-11-07 05:48:44,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511457639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:44,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:44,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:48:44,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190200550] [2024-11-07 05:48:44,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:44,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:48:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:44,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:48:44,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:48:44,889 INFO L87 Difference]: Start difference. First operand 139 states and 205 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:48:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:45,135 INFO L93 Difference]: Finished difference Result 322 states and 468 transitions. [2024-11-07 05:48:45,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:48:45,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-07 05:48:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:45,140 INFO L225 Difference]: With dead ends: 322 [2024-11-07 05:48:45,140 INFO L226 Difference]: Without dead ends: 186 [2024-11-07 05:48:45,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:48:45,145 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 163 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:45,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 298 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:48:45,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-07 05:48:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 139. [2024-11-07 05:48:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 99 states have internal predecessors, (128), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 05:48:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 204 transitions. [2024-11-07 05:48:45,176 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 204 transitions. Word has length 191 [2024-11-07 05:48:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:45,179 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 204 transitions. [2024-11-07 05:48:45,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:48:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 204 transitions. [2024-11-07 05:48:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 05:48:45,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:45,185 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:48:45,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:45,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:45,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1893870358, now seen corresponding path program 1 times [2024-11-07 05:48:45,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:45,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180225911] [2024-11-07 05:48:45,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:45,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:48:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:48:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 05:48:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:48:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:48:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:48:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:48:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:48:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:48:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:48:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:48:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 05:48:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 05:48:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 05:48:45,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:45,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180225911] [2024-11-07 05:48:45,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180225911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:48:45,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772190672] [2024-11-07 05:48:45,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:45,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:48:45,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:45,702 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:48:45,708 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:48:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:45,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 05:48:45,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-07 05:48:46,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:48:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 05:48:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772190672] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:48:46,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:48:46,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-07 05:48:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422232476] [2024-11-07 05:48:46,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:48:46,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 05:48:46,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:46,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 05:48:46,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:48:46,553 INFO L87 Difference]: Start difference. First operand 139 states and 204 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-07 05:48:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:46,926 INFO L93 Difference]: Finished difference Result 361 states and 510 transitions. [2024-11-07 05:48:46,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 05:48:46,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 191 [2024-11-07 05:48:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:46,933 INFO L225 Difference]: With dead ends: 361 [2024-11-07 05:48:46,933 INFO L226 Difference]: Without dead ends: 225 [2024-11-07 05:48:46,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-07 05:48:46,935 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 190 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:46,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 329 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:48:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-07 05:48:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2024-11-07 05:48:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 129 states have (on average 1.2635658914728682) internal successors, (163), 130 states have internal predecessors, (163), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 05:48:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 239 transitions. [2024-11-07 05:48:46,971 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 239 transitions. Word has length 191 [2024-11-07 05:48:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:46,971 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 239 transitions. [2024-11-07 05:48:46,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-07 05:48:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 239 transitions. [2024-11-07 05:48:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 05:48:46,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:46,976 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,996 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:48:47,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:48:47,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:47,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:47,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1093786710, now seen corresponding path program 1 times [2024-11-07 05:48:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:47,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442306595] [2024-11-07 05:48:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:47,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:48:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:48:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 05:48:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:48:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:48:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:48:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:48:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:48:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:48:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:48:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:48:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 05:48:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 05:48:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:48:47,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:47,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442306595] [2024-11-07 05:48:47,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442306595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:47,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:47,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:48:47,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312519356] [2024-11-07 05:48:47,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:47,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:48:47,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:47,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:48:47,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:47,359 INFO L87 Difference]: Start difference. First operand 172 states and 239 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:48:47,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:47,400 INFO L93 Difference]: Finished difference Result 453 states and 618 transitions. [2024-11-07 05:48:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:48:47,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-07 05:48:47,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:47,405 INFO L225 Difference]: With dead ends: 453 [2024-11-07 05:48:47,406 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 05:48:47,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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:47,407 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 77 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:47,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 285 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:48:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 05:48:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2024-11-07 05:48:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 212 states have (on average 1.221698113207547) internal successors, (259), 215 states have internal predecessors, (259), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 05:48:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 379 transitions. [2024-11-07 05:48:47,451 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 379 transitions. Word has length 191 [2024-11-07 05:48:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:47,452 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 379 transitions. [2024-11-07 05:48:47,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:48:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 379 transitions. [2024-11-07 05:48:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 05:48:47,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:47,456 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 05:48:47,456 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:47,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:47,456 INFO L85 PathProgramCache]: Analyzing trace with hash -494561192, now seen corresponding path program 1 times [2024-11-07 05:48:47,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:47,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180005638] [2024-11-07 05:48:47,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:47,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:48:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:48:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 05:48:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:48:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:48:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:48:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:48:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:48:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:48:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:48:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:48:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 05:48:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 05:48:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 05:48:47,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180005638] [2024-11-07 05:48:47,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180005638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:48:47,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607082394] [2024-11-07 05:48:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:47,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:48:47,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:47,949 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:48:47,951 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:48:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:48,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 05:48:48,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-07 05:48:50,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:48:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 05:48:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607082394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:48:51,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:48:51,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-07 05:48:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553034697] [2024-11-07 05:48:51,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:48:51,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 05:48:51,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 05:48:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=102, Unknown=4, NotChecked=0, Total=156 [2024-11-07 05:48:51,396 INFO L87 Difference]: Start difference. First operand 281 states and 379 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 4 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) [2024-11-07 05:48:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:52,930 INFO L93 Difference]: Finished difference Result 567 states and 759 transitions. [2024-11-07 05:48:52,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 05:48:52,931 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 4 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) Word has length 191 [2024-11-07 05:48:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:52,935 INFO L225 Difference]: With dead ends: 567 [2024-11-07 05:48:52,935 INFO L226 Difference]: Without dead ends: 289 [2024-11-07 05:48:52,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=277, Unknown=10, NotChecked=0, Total=420 [2024-11-07 05:48:52,937 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 154 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 41 mSolverCounterUnsat, 128 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 128 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:52,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 190 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 224 Invalid, 128 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 05:48:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-07 05:48:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 247. [2024-11-07 05:48:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 181 states have internal predecessors, (215), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 05:48:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 335 transitions. [2024-11-07 05:48:52,967 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 335 transitions. Word has length 191 [2024-11-07 05:48:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:52,970 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 335 transitions. [2024-11-07 05:48:52,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 4 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) [2024-11-07 05:48:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 335 transitions. [2024-11-07 05:48:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 05:48:52,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:52,973 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,992 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:48:53,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:48:53,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:53,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash -287902149, now seen corresponding path program 1 times [2024-11-07 05:48:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:53,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352547076] [2024-11-07 05:48:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:53,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:48:53,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [520340314] [2024-11-07 05:48:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:53,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:48:53,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:53,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:48:53,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 05:48:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:48:53,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:48:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:48:53,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:48:53,973 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:48:53,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:48:53,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 05:48:54,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:48:54,179 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:54,302 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:48:54,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:48:54 BoogieIcfgContainer [2024-11-07 05:48:54,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:48:54,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:48:54,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:48:54,306 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:48:54,307 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:43" (3/4) ... [2024-11-07 05:48:54,309 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:48:54,309 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:48:54,312 INFO L158 Benchmark]: Toolchain (without parser) took 12356.59ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 91.3MB in the beginning and 129.3MB in the end (delta: -38.0MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2024-11-07 05:48:54,312 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:48:54,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.35ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 76.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:48:54,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.18ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 72.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:48:54,314 INFO L158 Benchmark]: Boogie Preprocessor took 61.70ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 68.4MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:48:54,314 INFO L158 Benchmark]: RCFGBuilder took 650.23ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 88.5MB in the end (delta: -20.1MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-07 05:48:54,314 INFO L158 Benchmark]: TraceAbstraction took 11207.98ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 88.0MB in the beginning and 129.4MB in the end (delta: -41.3MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-11-07 05:48:54,314 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 201.3MB. Free memory was 129.4MB in the beginning and 129.3MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:48:54,316 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.98ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.35ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 76.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.18ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 72.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.70ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 68.4MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 650.23ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 88.5MB in the end (delta: -20.1MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11207.98ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 88.0MB in the beginning and 129.4MB in the end (delta: -41.3MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 201.3MB. Free memory was 129.4MB in the beginning and 129.3MB in the end (delta: 48.7kB). 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 175, overapproximation of shiftRight at line 110, overapproximation of someBinaryArithmeticDOUBLEoperation at line 122, overapproximation of someUnaryDOUBLEoperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 175. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.25; [L23] signed long int var_1_3 = -25; [L24] signed long int var_1_4 = -128; [L25] double var_1_6 = 2.75; [L26] double var_1_7 = 24.5; [L27] double var_1_8 = 199.5; [L28] float var_1_9 = 32.8; [L29] unsigned char var_1_10 = 1; [L30] float var_1_11 = 15.4; [L31] float var_1_12 = 0.0; [L32] unsigned long int var_1_13 = 2; [L33] float var_1_16 = 127.6; [L34] signed long int var_1_17 = 128; [L35] unsigned char var_1_19 = 10; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 64; [L38] double var_1_22 = 15.95; [L39] unsigned long int var_1_23 = 4127848294; [L40] unsigned long int var_1_24 = 256; [L41] unsigned char var_1_27 = 1; [L42] unsigned char var_1_29 = 1; [L43] unsigned char var_1_30 = 0; [L44] unsigned char var_1_31 = 1; [L45] double var_1_32 = 32.7; [L46] unsigned char var_1_34 = 1; [L47] unsigned long int var_1_35 = 1000; [L48] signed char var_1_39 = -32; [L49] signed char var_1_40 = 16; [L50] signed char var_1_41 = 4; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_43 = 0; [L53] float var_1_44 = 99999999999.2; VAL [isInitial=0, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-25, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L179] isInitial = 1 [L180] FCALL initially() [L181] COND TRUE 1 [L182] FCALL updateLastVariables() [L183] CALL updateVariables() [L126] var_1_3 = __VERIFIER_nondet_long() [L127] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L127] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L128] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L128] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L129] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L129] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L130] var_1_4 = __VERIFIER_nondet_long() [L131] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L131] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L132] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L132] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L133] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L133] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L134] var_1_6 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L135] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L136] var_1_7 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L137] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L138] var_1_8 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L139] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L140] var_1_10 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L141] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L142] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L142] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L143] var_1_11 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L144] RET assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L145] var_1_12 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L146] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L147] var_1_20 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L148] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L149] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L149] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L150] var_1_21 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L151] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L152] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L152] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L153] var_1_23 = __VERIFIER_nondet_ulong() [L154] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L154] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L155] CALL assume_abort_if_not(var_1_23 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L155] RET assume_abort_if_not(var_1_23 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L156] var_1_29 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L157] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L158] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L158] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L159] var_1_30 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L160] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L161] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L161] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L162] var_1_40 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_40 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L163] RET assume_abort_if_not(var_1_40 >= -63) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L164] CALL assume_abort_if_not(var_1_40 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L164] RET assume_abort_if_not(var_1_40 <= 63) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L165] var_1_41 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L166] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L167] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L167] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L168] var_1_43 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L169] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L170] CALL assume_abort_if_not(var_1_43 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L170] RET assume_abort_if_not(var_1_43 <= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L183] RET updateVariables() [L184] CALL step() [L57] COND TRUE var_1_12 <= (var_1_7 * 5.8f) [L58] var_1_16 = ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L62] COND TRUE var_1_10 || var_1_20 [L63] var_1_19 = ((((var_1_21) > (32)) ? (var_1_21) : (32))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=34, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L65] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=34, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L70] signed long int stepLocal_0 = (var_1_3 % var_1_4) * var_1_19; VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=34, var_1_1=21/4, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L71] COND TRUE var_1_19 > stepLocal_0 [L72] var_1_1 = (var_1_6 - (var_1_7 + var_1_8)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L76] COND TRUE ! var_1_10 [L77] var_1_13 = (50u + var_1_19) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L81] COND FALSE !(var_1_8 < (var_1_22 / var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L86] COND FALSE !(var_1_10 || (var_1_19 == var_1_13)) [L89] var_1_9 = ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L91] COND TRUE \read(var_1_20) [L92] var_1_24 = ((((((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) < (64u)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (64u)))) > (32u)) ? (((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) < (64u)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (64u)))) : (32u))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L94] COND FALSE !(var_1_19 <= 32u) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=1, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L99] COND TRUE (~ var_1_19) < var_1_19 [L100] var_1_27 = 0 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=-255, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L105] var_1_31 = var_1_30 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=-255, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L106] COND TRUE var_1_19 <= var_1_19 [L107] var_1_32 = (((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=-255, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L109] var_1_34 = (! (var_1_10 && var_1_30)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=-255, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L110] EXPR var_1_3 >> var_1_19 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=-255, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L110] COND FALSE !(((var_1_3 >> var_1_19) % -10) >= var_1_19) [L115] COND FALSE !(-32 >= var_1_19) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=-255, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L118] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=-255, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L121] COND TRUE var_1_12 < ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))) [L122] var_1_44 = (var_1_8 + var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=-255, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L184] RET step() [L185] CALL, EXPR property() [L175] EXPR (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=-255, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L175-L176] return (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) ; [L185] RET, EXPR property() [L185] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=-255, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-222, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=-255, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 128 mSolverCounterUnknown, 638 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 638 mSDsluCounter, 1517 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 724 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 647 IncrementalHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 793 mSDtfsCounter, 647 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1173 GetRequests, 1139 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=5, InterpolantAutomatonStates: 36, 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, 148 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1912 NumberOfCodeBlocks, 1912 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1900 ConstructedInterpolants, 11 QuantifiedInterpolants, 6175 SizeOfPredicates, 4 NumberOfNonLiveVariables, 857 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 15772/16240 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:48:54,349 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-62.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 d2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:48:56,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:48:56,663 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:48:56,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:48:56,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:48:56,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:48:56,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:48:56,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:48:56,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:48:56,698 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:48:56,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:48:56,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:48:56,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:48:56,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:48:56,699 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:48:56,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:48:56,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:48:56,699 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:48:56,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:48:56,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:48:56,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:48:56,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:48:56,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:48:56,701 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:48:56,701 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:48:56,701 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:48:56,702 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:48:56,702 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:48:56,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:48:56,702 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:48:56,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:48:56,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:48:56,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:48:56,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:48:56,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:48:56,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:48:56,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:48:56,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:48:56,704 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:48:56,704 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:48:56,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:48:56,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:48:56,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:48:56,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:48:56,704 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 -> d2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724 [2024-11-07 05:48:56,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:48:56,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:48:56,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:48:56,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:48:56,986 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:48:56,987 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-62.i [2024-11-07 05:48:58,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:48:58,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:48:58,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-11-07 05:48:58,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaacf72e7/140df2ae60c643b48309992ec55a6ca1/FLAGb0b807cf0 [2024-11-07 05:48:59,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaacf72e7/140df2ae60c643b48309992ec55a6ca1 [2024-11-07 05:48:59,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:48:59,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:48:59,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:48:59,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:48:59,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:48:59,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:48:59" (1/1) ... [2024-11-07 05:48:59,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db256e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:59, skipping insertion in model container [2024-11-07 05:48:59,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:48:59" (1/1) ... [2024-11-07 05:48:59,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:48:59,184 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-62.i[919,932] [2024-11-07 05:48:59,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:48:59,286 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:48:59,300 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-62.i[919,932] [2024-11-07 05:48:59,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:48:59,369 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:48:59,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:59 WrapperNode [2024-11-07 05:48:59,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:48:59,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:48:59,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:48:59,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:48:59,378 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:59" (1/1) ... [2024-11-07 05:48:59,396 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:59" (1/1) ... [2024-11-07 05:48:59,426 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-07 05:48:59,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:48:59,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:48:59,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:48:59,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:48:59,436 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:59" (1/1) ... [2024-11-07 05:48:59,436 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:59" (1/1) ... [2024-11-07 05:48:59,440 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:59" (1/1) ... [2024-11-07 05:48:59,461 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:59,464 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:59" (1/1) ... [2024-11-07 05:48:59,465 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:59" (1/1) ... [2024-11-07 05:48:59,477 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:59" (1/1) ... [2024-11-07 05:48:59,486 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:59" (1/1) ... [2024-11-07 05:48:59,490 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:59" (1/1) ... [2024-11-07 05:48:59,492 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:59" (1/1) ... [2024-11-07 05:48:59,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:48:59,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:48:59,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:48:59,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:48:59,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:59" (1/1) ... [2024-11-07 05:48:59,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:48:59,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:59,534 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:59,538 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:59,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:48:59,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:48:59,560 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:48:59,561 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:48:59,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:48:59,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:48:59,669 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:48:59,672 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:49:32,695 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 05:49:32,696 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:49:32,712 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:49:32,713 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:49:32,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:49:32 BoogieIcfgContainer [2024-11-07 05:49:32,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:49:32,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:49:32,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:49:32,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:49:32,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:48:59" (1/3) ... [2024-11-07 05:49:32,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cb9af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:49:32, skipping insertion in model container [2024-11-07 05:49:32,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:59" (2/3) ... [2024-11-07 05:49:32,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cb9af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:49:32, skipping insertion in model container [2024-11-07 05:49:32,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:49:32" (3/3) ... [2024-11-07 05:49:32,725 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-11-07 05:49:32,741 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:49:32,743 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:49:32,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:49:32,812 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;@2825a2b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:49:32,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:49:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 05:49:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 05:49:32,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:32,834 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:32,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:32,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:32,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1979626511, now seen corresponding path program 1 times [2024-11-07 05:49:32,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:49:32,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314320149] [2024-11-07 05:49:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:32,855 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:49:32,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:49:32,859 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:49:32,861 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:49:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:34,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:49:34,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:49:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-07 05:49:34,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:49:34,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:49:34,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314320149] [2024-11-07 05:49:34,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314320149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:49:34,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:49:34,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:49:34,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640273157] [2024-11-07 05:49:34,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:49:34,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:49:34,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:49:34,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:49:34,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:49:34,446 INFO L87 Difference]: Start difference. First operand has 86 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 05:49:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:49:34,476 INFO L93 Difference]: Finished difference Result 165 states and 295 transitions. [2024-11-07 05:49:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:49:34,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 188 [2024-11-07 05:49:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:49:34,484 INFO L225 Difference]: With dead ends: 165 [2024-11-07 05:49:34,484 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 05:49:34,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 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:49:34,490 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:49:34,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:49:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 05:49:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 05:49:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 05:49:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-11-07 05:49:34,530 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 188 [2024-11-07 05:49:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:49:34,531 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-11-07 05:49:34,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 05:49:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-11-07 05:49:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 05:49:34,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:34,535 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:34,577 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:49:34,735 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:49:34,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:34,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2003651845, now seen corresponding path program 1 times [2024-11-07 05:49:34,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:49:34,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137109881] [2024-11-07 05:49:34,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:34,738 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:49:34,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:49:34,741 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:49:34,743 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:49:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:36,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 05:49:36,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:49:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:49:37,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:49:37,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:49:37,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137109881] [2024-11-07 05:49:37,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137109881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:49:37,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:49:37,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:49:37,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091349875] [2024-11-07 05:49:37,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:49:37,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:49:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:49:37,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:49:37,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:49:37,052 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:49:41,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:49:45,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:49:49,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:49:54,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:49:58,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:49:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:49:58,632 INFO L93 Difference]: Finished difference Result 206 states and 312 transitions. [2024-11-07 05:49:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:49:58,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-11-07 05:49:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:49:58,637 INFO L225 Difference]: With dead ends: 206 [2024-11-07 05:49:58,637 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 05:49:58,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:49:58,642 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 48 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:49:58,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 259 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 21.6s Time] [2024-11-07 05:49:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 05:49:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2024-11-07 05:49:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 84 states have internal predecessors, (109), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 05:49:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 185 transitions. [2024-11-07 05:49:58,669 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 185 transitions. Word has length 188 [2024-11-07 05:49:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:49:58,670 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 185 transitions. [2024-11-07 05:49:58,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:49:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 185 transitions. [2024-11-07 05:49:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 05:49:58,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:58,676 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:58,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 05:49:58,877 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:49:58,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:58,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash -358045641, now seen corresponding path program 1 times [2024-11-07 05:49:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:49:58,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718320292] [2024-11-07 05:49:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:58,879 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:49:58,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:49:58,882 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:49:58,883 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:50:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:00,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 05:50:00,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:50:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:50:01,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:50:01,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:50:01,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718320292] [2024-11-07 05:50:01,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718320292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:01,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:01,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:50:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373579837] [2024-11-07 05:50:01,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:01,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:50:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:50:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:50:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:50:01,246 INFO L87 Difference]: Start difference. First operand 124 states and 185 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:50:02,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:50:08,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:50:12,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:50:16,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []