./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.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', '9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.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 9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:14:29,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:14:29,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:14:29,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:14:29,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:14:29,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:14:29,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:14:29,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:14:29,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:14:29,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:14:29,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:14:29,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:14:29,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:14:29,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:14:29,904 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:14:29,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:14:29,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:14:29,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:14:29,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:14:29,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:14:29,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:14:29,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:14:29,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:14:29,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:14:29,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:14:29,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:14:29,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:14:29,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:14:29,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:14:29,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:14:29,906 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 -> 9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6 [2024-11-07 08:14:30,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:14:30,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:14:30,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:14:30,211 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:14:30,211 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:14:30,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i [2024-11-07 08:14:31,612 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:14:31,882 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:14:31,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i [2024-11-07 08:14:31,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be38cbddb/33ec9b549686490587ebee47b72ffe75/FLAG86eab910b [2024-11-07 08:14:31,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be38cbddb/33ec9b549686490587ebee47b72ffe75 [2024-11-07 08:14:31,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:14:31,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:14:31,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:14:31,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:14:31,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:14:31,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:14:31" (1/1) ... [2024-11-07 08:14:31,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eed9319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:31, skipping insertion in model container [2024-11-07 08:14:31,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:14:31" (1/1) ... [2024-11-07 08:14:31,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:14:32,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i[915,928] [2024-11-07 08:14:32,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:14:32,191 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:14:32,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i[915,928] [2024-11-07 08:14:32,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:14:32,268 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:14:32,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32 WrapperNode [2024-11-07 08:14:32,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:14:32,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:14:32,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:14:32,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:14:32,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (1/1) ... [2024-11-07 08:14:32,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (1/1) ... [2024-11-07 08:14:32,330 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2024-11-07 08:14:32,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:14:32,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:14:32,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:14:32,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:14:32,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (1/1) ... [2024-11-07 08:14:32,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (1/1) ... [2024-11-07 08:14:32,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (1/1) ... [2024-11-07 08:14:32,369 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:14:32,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (1/1) ... [2024-11-07 08:14:32,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (1/1) ... [2024-11-07 08:14:32,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (1/1) ... [2024-11-07 08:14:32,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (1/1) ... [2024-11-07 08:14:32,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (1/1) ... [2024-11-07 08:14:32,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (1/1) ... [2024-11-07 08:14:32,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:14:32,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:14:32,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:14:32,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:14:32,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (1/1) ... [2024-11-07 08:14:32,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:14:32,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:14:32,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:14:32,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:14:32,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:14:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:14:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:14:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:14:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:14:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:14:32,528 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:14:32,529 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:14:32,947 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-07 08:14:32,948 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:14:32,959 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:14:32,960 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:14:32,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:14:32 BoogieIcfgContainer [2024-11-07 08:14:32,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:14:32,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:14:32,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:14:32,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:14:32,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:14:31" (1/3) ... [2024-11-07 08:14:32,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5b5e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:14:32, skipping insertion in model container [2024-11-07 08:14:32,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:32" (2/3) ... [2024-11-07 08:14:32,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5b5e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:14:32, skipping insertion in model container [2024-11-07 08:14:32,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:14:32" (3/3) ... [2024-11-07 08:14:32,970 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-8.i [2024-11-07 08:14:32,984 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:14:32,984 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:14:33,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:14:33,046 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;@73d49ce5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:14:33,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:14:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 76 states have internal predecessors, (109), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 08:14:33,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-07 08:14:33,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:14:33,072 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:14:33,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:14:33,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:14:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1342674343, now seen corresponding path program 1 times [2024-11-07 08:14:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:14:33,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38331090] [2024-11-07 08:14:33,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:14:33,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:14:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:14:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:14:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:14:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:14:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:14:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:14:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:14:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:14:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:14:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:14:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:14:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:14:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:14:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:14:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:14:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:14:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:14:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:14:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:14:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:14:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:14:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:14:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:14:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 08:14:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:14:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 08:14:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:14:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 08:14:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:14:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 08:14:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-07 08:14:33,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:14:33,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38331090] [2024-11-07 08:14:33,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38331090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:14:33,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:14:33,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:14:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363239034] [2024-11-07 08:14:33,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:14:33,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:14:33,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:14:33,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:14:33,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:14:33,940 INFO L87 Difference]: Start difference. First operand has 108 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 76 states have internal predecessors, (109), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:34,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:14:34,088 INFO L93 Difference]: Finished difference Result 310 states and 555 transitions. [2024-11-07 08:14:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:14:34,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-11-07 08:14:34,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:14:34,104 INFO L225 Difference]: With dead ends: 310 [2024-11-07 08:14:34,105 INFO L226 Difference]: Without dead ends: 205 [2024-11-07 08:14:34,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:14:34,114 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 154 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:14:34,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 447 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:14:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-07 08:14:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 114. [2024-11-07 08:14:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 08:14:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 177 transitions. [2024-11-07 08:14:34,183 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 177 transitions. Word has length 198 [2024-11-07 08:14:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:14:34,188 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 177 transitions. [2024-11-07 08:14:34,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 177 transitions. [2024-11-07 08:14:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-07 08:14:34,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:14:34,195 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:14:34,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:14:34,196 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:14:34,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:14:34,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1600839781, now seen corresponding path program 1 times [2024-11-07 08:14:34,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:14:34,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840039831] [2024-11-07 08:14:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:14:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:14:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:14:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:14:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:14:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:14:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:14:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:14:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:14:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:14:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:14:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:14:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:14:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:14:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:14:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:14:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:14:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:14:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:14:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:14:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:14:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:14:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:14:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:14:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:14:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 08:14:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:14:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 08:14:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:14:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 08:14:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:14:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 08:14:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-07 08:14:34,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:14:34,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840039831] [2024-11-07 08:14:34,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840039831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:14:34,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:14:34,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:14:34,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780034690] [2024-11-07 08:14:34,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:14:34,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:14:34,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:14:34,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:14:34,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:14:34,542 INFO L87 Difference]: Start difference. First operand 114 states and 177 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:34,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:14:34,600 INFO L93 Difference]: Finished difference Result 301 states and 474 transitions. [2024-11-07 08:14:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:14:34,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-11-07 08:14:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:14:34,605 INFO L225 Difference]: With dead ends: 301 [2024-11-07 08:14:34,605 INFO L226 Difference]: Without dead ends: 190 [2024-11-07 08:14:34,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:14:34,608 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 154 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:14:34,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 395 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:14:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-07 08:14:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 104. [2024-11-07 08:14:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 08:14:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 160 transitions. [2024-11-07 08:14:34,632 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 160 transitions. Word has length 198 [2024-11-07 08:14:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:14:34,632 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 160 transitions. [2024-11-07 08:14:34,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 160 transitions. [2024-11-07 08:14:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 08:14:34,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:14:34,640 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:14:34,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:14:34,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:14:34,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:14:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash -954519701, now seen corresponding path program 1 times [2024-11-07 08:14:34,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:14:34,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205930957] [2024-11-07 08:14:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:14:34,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:14:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:14:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:14:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:14:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:14:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:14:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:14:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:14:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:14:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:14:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:14:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:14:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:14:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:14:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:14:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:14:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:14:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:14:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:14:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:14:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:14:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:14:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:14:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:14:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 08:14:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:14:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 08:14:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:14:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 08:14:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:14:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 08:14:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-07 08:14:34,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:14:34,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205930957] [2024-11-07 08:14:34,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205930957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:14:34,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:14:34,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:14:34,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906844014] [2024-11-07 08:14:34,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:14:34,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:14:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:14:34,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:14:34,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:14:34,963 INFO L87 Difference]: Start difference. First operand 104 states and 160 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:14:35,042 INFO L93 Difference]: Finished difference Result 306 states and 474 transitions. [2024-11-07 08:14:35,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:14:35,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-11-07 08:14:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:14:35,045 INFO L225 Difference]: With dead ends: 306 [2024-11-07 08:14:35,045 INFO L226 Difference]: Without dead ends: 205 [2024-11-07 08:14:35,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:14:35,047 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 87 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:14:35,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 286 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:14:35,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-07 08:14:35,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2024-11-07 08:14:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 08:14:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 312 transitions. [2024-11-07 08:14:35,089 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 312 transitions. Word has length 199 [2024-11-07 08:14:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:14:35,091 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 312 transitions. [2024-11-07 08:14:35,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 312 transitions. [2024-11-07 08:14:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-07 08:14:35,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:14:35,094 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:14:35,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:14:35,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:14:35,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:14:35,096 INFO L85 PathProgramCache]: Analyzing trace with hash -135658558, now seen corresponding path program 1 times [2024-11-07 08:14:35,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:14:35,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444940303] [2024-11-07 08:14:35,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:14:35,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:14:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:14:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:14:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:14:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:14:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:14:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:14:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:14:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:14:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:14:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:14:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:14:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:14:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:14:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:14:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:14:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:14:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:14:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:14:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:14:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:14:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:14:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:14:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:14:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 08:14:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:14:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 08:14:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:14:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 08:14:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:14:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 08:14:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-07 08:14:35,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:14:35,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444940303] [2024-11-07 08:14:35,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444940303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:14:35,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:14:35,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:14:35,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976045510] [2024-11-07 08:14:35,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:14:35,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:14:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:14:35,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:14:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:14:35,463 INFO L87 Difference]: Start difference. First operand 202 states and 312 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:14:35,843 INFO L93 Difference]: Finished difference Result 505 states and 779 transitions. [2024-11-07 08:14:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:14:35,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-07 08:14:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:14:35,848 INFO L225 Difference]: With dead ends: 505 [2024-11-07 08:14:35,848 INFO L226 Difference]: Without dead ends: 306 [2024-11-07 08:14:35,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:14:35,851 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 259 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:14:35,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 488 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:14:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-07 08:14:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 214. [2024-11-07 08:14:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 151 states have (on average 1.3708609271523178) internal successors, (207), 151 states have internal predecessors, (207), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 08:14:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 327 transitions. [2024-11-07 08:14:35,884 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 327 transitions. Word has length 200 [2024-11-07 08:14:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:14:35,885 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 327 transitions. [2024-11-07 08:14:35,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 327 transitions. [2024-11-07 08:14:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-07 08:14:35,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:14:35,887 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:14:35,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:14:35,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:14:35,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:14:35,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1146775808, now seen corresponding path program 1 times [2024-11-07 08:14:35,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:14:35,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605609947] [2024-11-07 08:14:35,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:14:35,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:14:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:14:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:14:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:14:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:14:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:14:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:14:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:14:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:14:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:14:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:14:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:14:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:14:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:14:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:14:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:14:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:14:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:14:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:14:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:14:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:14:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:14:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:14:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:14:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 08:14:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:14:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 08:14:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:14:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 08:14:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:14:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 08:14:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-07 08:14:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:14:36,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605609947] [2024-11-07 08:14:36,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605609947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:14:36,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:14:36,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:14:36,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947937200] [2024-11-07 08:14:36,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:14:36,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:14:36,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:14:36,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:14:36,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:14:36,129 INFO L87 Difference]: Start difference. First operand 214 states and 327 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:14:36,451 INFO L93 Difference]: Finished difference Result 504 states and 777 transitions. [2024-11-07 08:14:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:14:36,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-07 08:14:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:14:36,455 INFO L225 Difference]: With dead ends: 504 [2024-11-07 08:14:36,455 INFO L226 Difference]: Without dead ends: 293 [2024-11-07 08:14:36,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:14:36,457 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 174 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:14:36,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 506 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:14:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-07 08:14:36,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 202. [2024-11-07 08:14:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 139 states have (on average 1.3669064748201438) internal successors, (190), 139 states have internal predecessors, (190), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 08:14:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 310 transitions. [2024-11-07 08:14:36,495 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 310 transitions. Word has length 200 [2024-11-07 08:14:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:14:36,496 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 310 transitions. [2024-11-07 08:14:36,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 310 transitions. [2024-11-07 08:14:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-07 08:14:36,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:14:36,500 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:14:36,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:14:36,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:14:36,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:14:36,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1763979587, now seen corresponding path program 1 times [2024-11-07 08:14:36,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:14:36,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592590524] [2024-11-07 08:14:36,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:14:36,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:14:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:14:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:14:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:14:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:14:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:14:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:14:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:14:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:14:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:14:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:14:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:14:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:14:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:14:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:14:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:14:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:14:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:14:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:14:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:14:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:14:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:14:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:14:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:14:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 08:14:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:14:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 08:14:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:14:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 08:14:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:14:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 08:14:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-07 08:14:36,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:14:36,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592590524] [2024-11-07 08:14:36,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592590524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:14:36,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:14:36,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:14:36,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770254333] [2024-11-07 08:14:36,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:14:36,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:14:36,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:14:36,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:14:36,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:14:36,734 INFO L87 Difference]: Start difference. First operand 202 states and 310 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:14:36,938 INFO L93 Difference]: Finished difference Result 524 states and 809 transitions. [2024-11-07 08:14:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:14:36,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-07 08:14:36,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:14:36,944 INFO L225 Difference]: With dead ends: 524 [2024-11-07 08:14:36,945 INFO L226 Difference]: Without dead ends: 423 [2024-11-07 08:14:36,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:14:36,947 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 183 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:14:36,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 566 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:14:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-07 08:14:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 209. [2024-11-07 08:14:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 146 states have (on average 1.3767123287671232) internal successors, (201), 146 states have internal predecessors, (201), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 08:14:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 321 transitions. [2024-11-07 08:14:36,983 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 321 transitions. Word has length 200 [2024-11-07 08:14:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:14:36,984 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 321 transitions. [2024-11-07 08:14:36,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 321 transitions. [2024-11-07 08:14:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-07 08:14:36,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:14:36,986 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:14:36,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:14:36,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:14:36,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:14:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1897993093, now seen corresponding path program 1 times [2024-11-07 08:14:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:14:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191735193] [2024-11-07 08:14:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:14:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:14:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:14:37,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311893305] [2024-11-07 08:14:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:14:37,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:14:37,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:14:37,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:14:37,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:14:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:14:37,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:14:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:14:37,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:14:37,648 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:14:37,649 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:14:37,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:14:37,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:14:37,858 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:14:38,009 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:14:38,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:14:38 BoogieIcfgContainer [2024-11-07 08:14:38,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:14:38,015 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:14:38,015 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:14:38,015 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:14:38,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:14:32" (3/4) ... [2024-11-07 08:14:38,019 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:14:38,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:14:38,021 INFO L158 Benchmark]: Toolchain (without parser) took 6100.00ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 76.7MB in the beginning and 73.2MB in the end (delta: 3.6MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2024-11-07 08:14:38,021 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:14:38,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.82ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 60.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:14:38,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.33ms. Allocated memory is still 100.7MB. Free memory was 60.7MB in the beginning and 57.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:14:38,021 INFO L158 Benchmark]: Boogie Preprocessor took 58.99ms. Allocated memory is still 100.7MB. Free memory was 56.9MB in the beginning and 51.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:14:38,022 INFO L158 Benchmark]: RCFGBuilder took 565.80ms. Allocated memory is still 100.7MB. Free memory was 51.8MB in the beginning and 59.9MB in the end (delta: -8.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-11-07 08:14:38,022 INFO L158 Benchmark]: TraceAbstraction took 5051.99ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 59.5MB in the beginning and 73.2MB in the end (delta: -13.7MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2024-11-07 08:14:38,022 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 151.0MB. Free memory was 73.2MB in the beginning and 73.2MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:14:38,023 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.28ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.82ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 60.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.33ms. Allocated memory is still 100.7MB. Free memory was 60.7MB in the beginning and 57.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.99ms. Allocated memory is still 100.7MB. Free memory was 56.9MB in the beginning and 51.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 565.80ms. Allocated memory is still 100.7MB. Free memory was 51.8MB in the beginning and 59.9MB in the end (delta: -8.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5051.99ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 59.5MB in the beginning and 73.2MB in the end (delta: -13.7MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 151.0MB. Free memory was 73.2MB in the beginning and 73.2MB in the end (delta: 30.0kB). 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 193, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryArithmeticFLOAToperation at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 256.8; [L23] signed long int var_1_4 = -5; [L24] float var_1_5 = 7.875; [L25] float var_1_6 = 99.04; [L26] signed long int var_1_7 = -2; [L27] signed long int var_1_8 = 1227169815; [L28] signed short int var_1_11 = 4; [L29] unsigned char var_1_12 = 1; [L30] double var_1_14 = -0.5; [L31] double var_1_15 = 7.5; [L32] unsigned char var_1_16 = 1; [L33] double var_1_17 = 25.2; [L34] double var_1_18 = 256.4; [L35] signed long int var_1_19 = 4; [L36] unsigned char var_1_20 = 1; [L37] unsigned char var_1_22 = 50; [L38] float var_1_23 = 15.4; [L39] signed short int var_1_24 = -32; [L40] signed short int var_1_25 = 20388; [L41] signed long int var_1_26 = 0; [L42] double var_1_27 = 0.6; [L43] unsigned char var_1_28 = 128; [L44] unsigned char var_1_29 = 5; [L45] signed char var_1_30 = -2; [L46] signed char var_1_31 = 5; [L47] signed char var_1_32 = 10; [L48] signed char var_1_33 = 4; [L49] signed char var_1_34 = 8; [L50] float last_1_var_1_1 = 256.8; [L51] unsigned char last_1_var_1_20 = 1; [L52] float last_1_var_1_23 = 15.4; VAL [isInitial=0, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_20 = var_1_20 [L190] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L140] var_1_4 = __VERIFIER_nondet_long() [L141] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L141] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L142] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L142] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L143] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L143] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L144] var_1_5 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L145] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L146] var_1_6 = __VERIFIER_nondet_float() [L147] 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, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1227169815] [L147] 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, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1227169815] [L148] var_1_8 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_8 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L149] RET assume_abort_if_not(var_1_8 >= 1073741822) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L150] CALL assume_abort_if_not(var_1_8 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L150] RET assume_abort_if_not(var_1_8 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L151] var_1_12 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L152] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L153] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L153] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L154] var_1_16 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L155] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L156] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L156] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L157] var_1_17 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L158] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L159] var_1_18 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L160] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L161] var_1_22 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L162] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L163] CALL assume_abort_if_not(var_1_22 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L163] RET assume_abort_if_not(var_1_22 <= 254) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L164] var_1_24 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_24 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L165] RET assume_abort_if_not(var_1_24 >= -32768) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L166] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L166] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L167] CALL assume_abort_if_not(var_1_24 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L167] RET assume_abort_if_not(var_1_24 != 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L168] var_1_25 = __VERIFIER_nondet_short() [L169] CALL assume_abort_if_not(var_1_25 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L169] RET assume_abort_if_not(var_1_25 >= 16383) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L170] CALL assume_abort_if_not(var_1_25 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L170] RET assume_abort_if_not(var_1_25 <= 32767) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L171] var_1_29 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L172] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L173] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L173] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L174] var_1_31 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_31 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L175] RET assume_abort_if_not(var_1_31 >= -63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L176] CALL assume_abort_if_not(var_1_31 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L176] RET assume_abort_if_not(var_1_31 <= 63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L177] var_1_32 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_32 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L178] RET assume_abort_if_not(var_1_32 >= -63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L179] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L179] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L180] var_1_33 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_33 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L181] RET assume_abort_if_not(var_1_33 >= -127) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L182] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L182] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L183] var_1_34 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_34 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L184] RET assume_abort_if_not(var_1_34 >= -127) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L185] CALL assume_abort_if_not(var_1_34 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L185] RET assume_abort_if_not(var_1_34 <= 126) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L201] RET updateVariables() [L202] CALL step() [L56] COND FALSE !(var_1_18 < last_1_var_1_23) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L67] COND TRUE var_1_8 > var_1_4 [L68] var_1_11 = 0 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L80] COND TRUE (var_1_22 + (var_1_20 / var_1_24)) <= var_1_20 [L81] var_1_27 = (10000.2 + (((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) < 0 ) ? -((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) : ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L85] signed long int stepLocal_5 = 10000000; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_5=10000000, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L86] COND TRUE (var_1_5 - var_1_6) >= var_1_27 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_5=10000000, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L87] COND TRUE stepLocal_5 > var_1_11 [L88] var_1_30 = (((((var_1_31 + var_1_32)) > (var_1_33)) ? ((var_1_31 + var_1_32)) : (var_1_33))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L93] signed char stepLocal_4 = var_1_30; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_4=0, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L94] COND TRUE ((var_1_30 + var_1_20) / var_1_4) > stepLocal_4 [L95] var_1_28 = ((((var_1_22) < (var_1_29)) ? (var_1_22) : (var_1_29))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L97] var_1_19 = (var_1_28 + (var_1_30 + var_1_11)) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L98] EXPR 8 << var_1_19 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L98] COND FALSE !(var_1_20 < ((8 << var_1_19) / ((((var_1_4) < (var_1_24)) ? (var_1_4) : (var_1_24))))) [L103] unsigned char stepLocal_1 = var_1_4 >= var_1_11; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_1=1, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L104] COND TRUE ((var_1_6 - var_1_5) < var_1_23) || stepLocal_1 [L105] var_1_7 = ((var_1_8 - var_1_28) - var_1_28) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=1073741822, var_1_8=1073741822] [L109] signed long int stepLocal_0 = var_1_7 % var_1_4; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=1073741822, var_1_8=1073741822] [L110] COND TRUE var_1_19 == stepLocal_0 [L111] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=1073741822, var_1_8=1073741822] [L113] COND FALSE !(\read(var_1_12)) [L120] var_1_14 = var_1_6 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L122] COND TRUE 1.000000004E8 == var_1_23 [L123] var_1_26 = (64 + var_1_20) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L127] unsigned char stepLocal_3 = var_1_16; [L128] signed long int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_2=1073741822, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L129] EXPR var_1_26 ^ var_1_30 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_2=1073741822, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L129] COND FALSE !(stepLocal_2 < (var_1_26 ^ var_1_30)) [L136] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR (((((var_1_19 == (var_1_7 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((((var_1_6 - var_1_5) < var_1_23) || (var_1_4 >= var_1_11)) ? (var_1_7 == ((signed long int) ((var_1_8 - var_1_28) - var_1_28))) : (var_1_7 == ((signed long int) -32)))) && ((var_1_8 > var_1_4) ? (var_1_11 == ((signed short int) 0)) : ((var_1_8 <= (last_1_var_1_20 + (last_1_var_1_20 / var_1_4))) ? (var_1_12 ? (var_1_11 == ((signed short int) last_1_var_1_20)) : (var_1_11 == ((signed short int) last_1_var_1_20))) : (var_1_11 == ((signed short int) last_1_var_1_20))))) && (var_1_12 ? ((((var_1_19 + var_1_20) * var_1_20) == ((var_1_8 + var_1_4) * var_1_20)) ? (var_1_14 == ((double) var_1_6)) : (var_1_14 == ((double) var_1_6))) : (var_1_14 == ((double) var_1_6)))) && ((var_1_8 < (var_1_26 ^ var_1_30)) ? (((! var_1_12) || var_1_16) ? (var_1_15 == ((double) ((((var_1_6) < ((var_1_17 + var_1_18))) ? (var_1_6) : ((var_1_17 + var_1_18)))))) : (var_1_15 == ((double) var_1_17))) : (var_1_15 == ((double) var_1_17))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L193] EXPR ((((((((var_1_19 == (var_1_7 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((((var_1_6 - var_1_5) < var_1_23) || (var_1_4 >= var_1_11)) ? (var_1_7 == ((signed long int) ((var_1_8 - var_1_28) - var_1_28))) : (var_1_7 == ((signed long int) -32)))) && ((var_1_8 > var_1_4) ? (var_1_11 == ((signed short int) 0)) : ((var_1_8 <= (last_1_var_1_20 + (last_1_var_1_20 / var_1_4))) ? (var_1_12 ? (var_1_11 == ((signed short int) last_1_var_1_20)) : (var_1_11 == ((signed short int) last_1_var_1_20))) : (var_1_11 == ((signed short int) last_1_var_1_20))))) && (var_1_12 ? ((((var_1_19 + var_1_20) * var_1_20) == ((var_1_8 + var_1_4) * var_1_20)) ? (var_1_14 == ((double) var_1_6)) : (var_1_14 == ((double) var_1_6))) : (var_1_14 == ((double) var_1_6)))) && ((var_1_8 < (var_1_26 ^ var_1_30)) ? (((! var_1_12) || var_1_16) ? (var_1_15 == ((double) ((((var_1_6) < ((var_1_17 + var_1_18))) ? (var_1_6) : ((var_1_17 + var_1_18)))))) : (var_1_15 == ((double) var_1_17))) : (var_1_15 == ((double) var_1_17)))) && (var_1_19 == ((signed long int) (var_1_28 + (var_1_30 + var_1_11))))) && ((var_1_18 < last_1_var_1_23) ? (var_1_12 ? (((last_1_var_1_1 + var_1_6) != last_1_var_1_1) ? (var_1_20 == ((unsigned char) var_1_22)) : (var_1_20 == ((unsigned char) var_1_22))) : (var_1_20 == ((unsigned char) var_1_22))) : 1)) && ((var_1_20 < ((8 << var_1_19) / ((((var_1_4) < (var_1_24)) ? (var_1_4) : (var_1_24))))) ? (((256 - (var_1_25 - var_1_22)) >= var_1_11) ? (var_1_23 == ((float) (((((var_1_5 - var_1_6)) < (var_1_17)) ? ((var_1_5 - var_1_6)) : (var_1_17))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L193-L194] return ((((((((((((var_1_19 == (var_1_7 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((((var_1_6 - var_1_5) < var_1_23) || (var_1_4 >= var_1_11)) ? (var_1_7 == ((signed long int) ((var_1_8 - var_1_28) - var_1_28))) : (var_1_7 == ((signed long int) -32)))) && ((var_1_8 > var_1_4) ? (var_1_11 == ((signed short int) 0)) : ((var_1_8 <= (last_1_var_1_20 + (last_1_var_1_20 / var_1_4))) ? (var_1_12 ? (var_1_11 == ((signed short int) last_1_var_1_20)) : (var_1_11 == ((signed short int) last_1_var_1_20))) : (var_1_11 == ((signed short int) last_1_var_1_20))))) && (var_1_12 ? ((((var_1_19 + var_1_20) * var_1_20) == ((var_1_8 + var_1_4) * var_1_20)) ? (var_1_14 == ((double) var_1_6)) : (var_1_14 == ((double) var_1_6))) : (var_1_14 == ((double) var_1_6)))) && ((var_1_8 < (var_1_26 ^ var_1_30)) ? (((! var_1_12) || var_1_16) ? (var_1_15 == ((double) ((((var_1_6) < ((var_1_17 + var_1_18))) ? (var_1_6) : ((var_1_17 + var_1_18)))))) : (var_1_15 == ((double) var_1_17))) : (var_1_15 == ((double) var_1_17)))) && (var_1_19 == ((signed long int) (var_1_28 + (var_1_30 + var_1_11))))) && ((var_1_18 < last_1_var_1_23) ? (var_1_12 ? (((last_1_var_1_1 + var_1_6) != last_1_var_1_1) ? (var_1_20 == ((unsigned char) var_1_22)) : (var_1_20 == ((unsigned char) var_1_22))) : (var_1_20 == ((unsigned char) var_1_22))) : 1)) && ((var_1_20 < ((8 << var_1_19) / ((((var_1_4) < (var_1_24)) ? (var_1_4) : (var_1_24))))) ? (((256 - (var_1_25 - var_1_22)) >= var_1_11) ? (var_1_23 == ((float) (((((var_1_5 - var_1_6)) < (var_1_17)) ? ((var_1_5 - var_1_6)) : (var_1_17))))) : 1) : 1)) && ((1.000000004E8 == var_1_23) ? (var_1_26 == ((signed long int) (64 + var_1_20))) : (var_1_26 == ((signed long int) ((((-4) < 0 ) ? -(-4) : (-4))))))) && (((var_1_22 + (var_1_20 / var_1_24)) <= var_1_20) ? (var_1_27 == ((double) (10000.2 + (((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) < 0 ) ? -((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) : ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))))))) : (var_1_27 == ((double) (var_1_5 - var_1_6))))) && ((((var_1_30 + var_1_20) / var_1_4) > var_1_30) ? (var_1_28 == ((unsigned char) ((((var_1_22) < (var_1_29)) ? (var_1_22) : (var_1_29))))) : 1)) && (((var_1_5 - var_1_6) >= var_1_27) ? ((10000000 > var_1_11) ? (var_1_30 == ((signed char) (((((var_1_31 + var_1_32)) > (var_1_33)) ? ((var_1_31 + var_1_32)) : (var_1_33))))) : (var_1_30 == ((signed char) var_1_34))) : 1) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=2, var_1_23=77/5, var_1_24=-1, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1011 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1011 mSDsluCounter, 2688 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1144 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 448 IncrementalHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 1544 mSDtfsCounter, 448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=4, InterpolantAutomatonStates: 21, 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, 577 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1595 NumberOfCodeBlocks, 1595 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1189 ConstructedInterpolants, 0 QuantifiedInterpolants, 2075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 10440/10440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 08:14:38,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.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 9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:14:40,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:14:40,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:14:40,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:14:40,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:14:40,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:14:40,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:14:40,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:14:40,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:14:40,381 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:14:40,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:14:40,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:14:40,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:14:40,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:14:40,382 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:14:40,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:14:40,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:14:40,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:14:40,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:14:40,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:14:40,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:14:40,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:14:40,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:14:40,383 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:14:40,383 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:14:40,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:14:40,383 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:14:40,383 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:14:40,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:14:40,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:14:40,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:14:40,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:14:40,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:14:40,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:14:40,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:14:40,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:14:40,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:14:40,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:14:40,387 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:14:40,387 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:14:40,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:14:40,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:14:40,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:14:40,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:14:40,388 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 -> 9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6 [2024-11-07 08:14:40,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:14:40,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:14:40,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:14:40,678 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:14:40,679 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:14:40,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i [2024-11-07 08:14:41,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:14:42,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:14:42,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i [2024-11-07 08:14:42,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/863ae58e1/efb29b29d3d94c8d9d328a543c14bc96/FLAG7fec840e1 [2024-11-07 08:14:42,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/863ae58e1/efb29b29d3d94c8d9d328a543c14bc96 [2024-11-07 08:14:42,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:14:42,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:14:42,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:14:42,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:14:42,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:14:42,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cc199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42, skipping insertion in model container [2024-11-07 08:14:42,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:14:42,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i[915,928] [2024-11-07 08:14:42,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:14:42,586 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:14:42,597 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i[915,928] [2024-11-07 08:14:42,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:14:42,681 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:14:42,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42 WrapperNode [2024-11-07 08:14:42,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:14:42,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:14:42,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:14:42,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:14:42,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,750 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-11-07 08:14:42,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:14:42,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:14:42,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:14:42,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:14:42,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,793 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:14:42,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:14:42,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:14:42,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:14:42,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:14:42,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (1/1) ... [2024-11-07 08:14:42,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:14:42,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:14:42,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:14:42,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:14:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:14:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:14:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:14:42,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:14:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:14:42,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:14:42,974 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:14:42,976 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:14:50,189 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 08:14:50,189 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:14:50,199 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:14:50,201 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:14:50,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:14:50 BoogieIcfgContainer [2024-11-07 08:14:50,202 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:14:50,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:14:50,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:14:50,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:14:50,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:14:42" (1/3) ... [2024-11-07 08:14:50,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176a5fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:14:50, skipping insertion in model container [2024-11-07 08:14:50,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:14:42" (2/3) ... [2024-11-07 08:14:50,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176a5fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:14:50, skipping insertion in model container [2024-11-07 08:14:50,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:14:50" (3/3) ... [2024-11-07 08:14:50,215 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-8.i [2024-11-07 08:14:50,230 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:14:50,231 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:14:50,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:14:50,314 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;@6cb6f63c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:14:50,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:14:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 08:14:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 08:14:50,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:14:50,338 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:14:50,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:14:50,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:14:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash 35157103, now seen corresponding path program 1 times [2024-11-07 08:14:50,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:14:50,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939200761] [2024-11-07 08:14:50,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:14:50,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:14:50,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:14:50,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:14:50,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 08:14:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:51,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:14:51,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:14:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-07 08:14:51,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:14:51,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:14:51,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939200761] [2024-11-07 08:14:51,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939200761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:14:51,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:14:51,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:14:51,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042929002] [2024-11-07 08:14:51,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:14:51,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:14:51,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:14:51,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:14:51,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:14:51,129 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:14:51,162 INFO L93 Difference]: Finished difference Result 173 states and 306 transitions. [2024-11-07 08:14:51,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:14:51,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 192 [2024-11-07 08:14:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:14:51,172 INFO L225 Difference]: With dead ends: 173 [2024-11-07 08:14:51,172 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 08:14:51,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:14:51,178 INFO L432 NwaCegarLoop]: 133 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, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:14:51,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:14:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 08:14:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 08:14:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 08:14:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-11-07 08:14:51,221 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 192 [2024-11-07 08:14:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:14:51,223 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-11-07 08:14:51,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-07 08:14:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-11-07 08:14:51,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 08:14:51,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:14:51,231 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:14:51,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 08:14:51,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:14:51,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:14:51,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:14:51,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1810164465, now seen corresponding path program 1 times [2024-11-07 08:14:51,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:14:51,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979449729] [2024-11-07 08:14:51,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:14:51,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:14:51,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:14:51,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:14:51,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:14:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:14:52,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-07 08:14:52,433 INFO L278 TraceCheckSpWp]: Computing forward predicates...