./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.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-51.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', '64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf'] 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-51.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 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:10:56,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:10:56,387 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:10:56,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:10:56,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:10:56,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:10:56,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:10:56,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:10:56,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:10:56,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:10:56,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:10:56,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:10:56,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:10:56,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:10:56,428 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:10:56,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:10:56,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:10:56,428 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:10:56,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:10:56,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:10:56,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:10:56,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:10:56,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:10:56,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:10:56,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:10:56,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:10:56,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:10:56,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:10:56,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:10:56,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:10:56,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:10:56,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:10:56,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:10:56,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:10:56,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:10:56,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:10:56,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:10:56,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:10:56,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:10:56,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:10:56,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:10:56,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:10:56,432 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 -> 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf [2024-11-07 08:10:56,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:10:56,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:10:56,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:10:56,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:10:56,731 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:10:56,732 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-51.i [2024-11-07 08:10:57,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:10:58,284 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:10:58,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-11-07 08:10:58,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae06f1504/c55ddd93d18440c4a0b66dfb529c026a/FLAG17423fbcf [2024-11-07 08:10:58,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae06f1504/c55ddd93d18440c4a0b66dfb529c026a [2024-11-07 08:10:58,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:10:58,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:10:58,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:10:58,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:10:58,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:10:58,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:10:58" (1/1) ... [2024-11-07 08:10:58,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70817d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58, skipping insertion in model container [2024-11-07 08:10:58,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:10:58" (1/1) ... [2024-11-07 08:10:58,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:10:58,719 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-51.i[916,929] [2024-11-07 08:10:58,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:10:58,831 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:10:58,847 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-51.i[916,929] [2024-11-07 08:10:58,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:10:58,903 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:10:58,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58 WrapperNode [2024-11-07 08:10:58,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:10:58,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:10:58,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:10:58,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:10:58,915 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:10:58" (1/1) ... [2024-11-07 08:10:58,927 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:10:58" (1/1) ... [2024-11-07 08:10:58,994 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-11-07 08:10:58,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:10:58,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:10:58,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:10:58,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:10:59,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58" (1/1) ... [2024-11-07 08:10:59,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58" (1/1) ... [2024-11-07 08:10:59,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58" (1/1) ... [2024-11-07 08:10:59,046 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:10:59,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58" (1/1) ... [2024-11-07 08:10:59,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58" (1/1) ... [2024-11-07 08:10:59,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58" (1/1) ... [2024-11-07 08:10:59,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58" (1/1) ... [2024-11-07 08:10:59,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58" (1/1) ... [2024-11-07 08:10:59,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58" (1/1) ... [2024-11-07 08:10:59,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:10:59,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:10:59,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:10:59,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:10:59,090 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58" (1/1) ... [2024-11-07 08:10:59,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:10:59,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:10:59,126 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:10:59,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:10:59,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:10:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:10:59,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:10:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:10:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:10:59,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:10:59,258 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:10:59,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:10:59,826 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-07 08:10:59,826 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:10:59,839 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:10:59,840 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:10:59,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:10:59 BoogieIcfgContainer [2024-11-07 08:10:59,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:10:59,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:10:59,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:10:59,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:10:59,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:10:58" (1/3) ... [2024-11-07 08:10:59,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71894ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:10:59, skipping insertion in model container [2024-11-07 08:10:59,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:10:58" (2/3) ... [2024-11-07 08:10:59,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71894ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:10:59, skipping insertion in model container [2024-11-07 08:10:59,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:10:59" (3/3) ... [2024-11-07 08:10:59,851 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-51.i [2024-11-07 08:10:59,863 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:10:59,864 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:10:59,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:10:59,917 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;@3022f92d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:10:59,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:10:59,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:10:59,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:10:59,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:10:59,940 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:10:59,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:10:59,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:10:59,945 INFO L85 PathProgramCache]: Analyzing trace with hash 37560582, now seen corresponding path program 1 times [2024-11-07 08:10:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:10:59,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459223748] [2024-11-07 08:10:59,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:10:59,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:11:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:11:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:11:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:11:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:11:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:11:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 08:11:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:11:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:11:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:11:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:11:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:11:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:11:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:11:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:11:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 08:11:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:11:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 08:11:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:11:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 08:11:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:11:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 08:11:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:11:00,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:00,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459223748] [2024-11-07 08:11:00,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459223748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:00,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:00,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:11:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486942704] [2024-11-07 08:11:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:00,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:11:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:00,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:11:00,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:11:00,548 INFO L87 Difference]: Start difference. First operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:11:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:00,585 INFO L93 Difference]: Finished difference Result 181 states and 322 transitions. [2024-11-07 08:11:00,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:11:00,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-07 08:11:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:00,593 INFO L225 Difference]: With dead ends: 181 [2024-11-07 08:11:00,594 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 08:11:00,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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:11:00,602 INFO L432 NwaCegarLoop]: 141 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, 141 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:11:00,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:11:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 08:11:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-07 08:11:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:11:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2024-11-07 08:11:00,647 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 203 [2024-11-07 08:11:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:00,647 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2024-11-07 08:11:00,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:11:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2024-11-07 08:11:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:11:00,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:00,651 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:00,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:11:00,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:00,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:00,653 INFO L85 PathProgramCache]: Analyzing trace with hash 653297218, now seen corresponding path program 1 times [2024-11-07 08:11:00,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:00,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104931396] [2024-11-07 08:11:00,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:00,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:11:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:11:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:11:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:11:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:11:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:11:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 08:11:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:11:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:11:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:11:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:11:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:11:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:11:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:11:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:01,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:11:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 08:11:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:11:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 08:11:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:11:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 08:11:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:11:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 08:11:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:11:02,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:02,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104931396] [2024-11-07 08:11:02,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104931396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:02,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:02,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:11:02,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560187746] [2024-11-07 08:11:02,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:02,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:11:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:02,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:11:02,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:11:02,145 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:11:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:02,499 INFO L93 Difference]: Finished difference Result 264 states and 417 transitions. [2024-11-07 08:11:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:11:02,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-07 08:11:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:02,504 INFO L225 Difference]: With dead ends: 264 [2024-11-07 08:11:02,504 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 08:11:02,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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:11:02,506 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 70 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:02,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 365 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:11:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 08:11:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2024-11-07 08:11:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 108 states have internal predecessors, (146), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:11:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 274 transitions. [2024-11-07 08:11:02,556 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 274 transitions. Word has length 203 [2024-11-07 08:11:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:02,559 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 274 transitions. [2024-11-07 08:11:02,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:11:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 274 transitions. [2024-11-07 08:11:02,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:11:02,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:02,566 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:02,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:11:02,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:02,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1674365572, now seen corresponding path program 1 times [2024-11-07 08:11:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433175858] [2024-11-07 08:11:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:11:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:11:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:11:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:11:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:11:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:11:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 08:11:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:11:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:11:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:11:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:11:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:11:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:11:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:11:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:11:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 08:11:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:11:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 08:11:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:11:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 08:11:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:11:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 08:11:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 08:11:03,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:03,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433175858] [2024-11-07 08:11:03,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433175858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:11:03,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263884598] [2024-11-07 08:11:03,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:03,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:11:03,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:11:03,224 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:11:03,228 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:11:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:03,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 08:11:03,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:11:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-11-07 08:11:03,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:11:04,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 08:11:04,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263884598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:11:04,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:11:04,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 08:11:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938302986] [2024-11-07 08:11:04,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:11:04,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:11:04,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:04,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:11:04,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:11:04,090 INFO L87 Difference]: Start difference. First operand 175 states and 274 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-07 08:11:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:04,383 INFO L93 Difference]: Finished difference Result 363 states and 559 transitions. [2024-11-07 08:11:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:11:04,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 203 [2024-11-07 08:11:04,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:04,389 INFO L225 Difference]: With dead ends: 363 [2024-11-07 08:11:04,390 INFO L226 Difference]: Without dead ends: 191 [2024-11-07 08:11:04,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 466 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:11:04,393 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 72 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:04,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 243 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:11:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-07 08:11:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2024-11-07 08:11:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:11:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 278 transitions. [2024-11-07 08:11:04,457 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 278 transitions. Word has length 203 [2024-11-07 08:11:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:04,458 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 278 transitions. [2024-11-07 08:11:04,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-07 08:11:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 278 transitions. [2024-11-07 08:11:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:11:04,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:04,464 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:04,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 08:11:04,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:11:04,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:04,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:04,665 INFO L85 PathProgramCache]: Analyzing trace with hash 394501894, now seen corresponding path program 1 times [2024-11-07 08:11:04,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:04,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385843642] [2024-11-07 08:11:04,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:04,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:11:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:11:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:11:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:11:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:11:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:11:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 08:11:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:11:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:11:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:11:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:11:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:11:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:11:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:11:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:11:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 08:11:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:11:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 08:11:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:11:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 08:11:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:11:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 08:11:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:11:05,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:05,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385843642] [2024-11-07 08:11:05,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385843642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:05,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:05,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:11:05,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222906530] [2024-11-07 08:11:05,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:05,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:11:05,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:05,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:11:05,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:11:05,373 INFO L87 Difference]: Start difference. First operand 183 states and 278 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:11:05,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:05,594 INFO L93 Difference]: Finished difference Result 366 states and 559 transitions. [2024-11-07 08:11:05,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:11:05,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-07 08:11:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:05,598 INFO L225 Difference]: With dead ends: 366 [2024-11-07 08:11:05,598 INFO L226 Difference]: Without dead ends: 275 [2024-11-07 08:11:05,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:11:05,599 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 128 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:05,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 494 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:11:05,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-07 08:11:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 183. [2024-11-07 08:11:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:11:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 278 transitions. [2024-11-07 08:11:05,647 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 278 transitions. Word has length 203 [2024-11-07 08:11:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:05,648 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 278 transitions. [2024-11-07 08:11:05,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:11:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 278 transitions. [2024-11-07 08:11:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 08:11:05,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:05,651 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:05,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:11:05,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:05,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:05,652 INFO L85 PathProgramCache]: Analyzing trace with hash -573679350, now seen corresponding path program 1 times [2024-11-07 08:11:05,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:05,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085418938] [2024-11-07 08:11:05,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:05,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:11:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:11:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:11:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:11:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:11:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:11:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 08:11:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:11:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:11:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:11:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:11:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:11:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:11:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:11:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:11:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 08:11:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:11:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 08:11:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:11:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 08:11:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:11:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 08:11:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:11:06,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:06,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085418938] [2024-11-07 08:11:06,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085418938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:06,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:06,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:11:06,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998623600] [2024-11-07 08:11:06,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:06,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:11:06,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:06,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:11:06,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:11:06,403 INFO L87 Difference]: Start difference. First operand 183 states and 278 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:11:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:06,866 INFO L93 Difference]: Finished difference Result 533 states and 802 transitions. [2024-11-07 08:11:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:11:06,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-11-07 08:11:06,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:06,872 INFO L225 Difference]: With dead ends: 533 [2024-11-07 08:11:06,872 INFO L226 Difference]: Without dead ends: 442 [2024-11-07 08:11:06,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:11:06,873 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 182 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:06,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 450 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:11:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-07 08:11:06,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 372. [2024-11-07 08:11:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 233 states have (on average 1.3004291845493563) internal successors, (303), 233 states have internal predecessors, (303), 128 states have call successors, (128), 10 states have call predecessors, (128), 10 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-07 08:11:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 559 transitions. [2024-11-07 08:11:06,971 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 559 transitions. Word has length 204 [2024-11-07 08:11:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:06,972 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 559 transitions. [2024-11-07 08:11:06,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:11:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 559 transitions. [2024-11-07 08:11:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 08:11:06,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:06,977 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:06,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:11:06,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:06,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash 15377899, now seen corresponding path program 1 times [2024-11-07 08:11:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051757461] [2024-11-07 08:11:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:11:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:11:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:11:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:11:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:11:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:11:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 08:11:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:11:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:11:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:11:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:11:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:11:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:11:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:11:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:11:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 08:11:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:11:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 08:11:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:11:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 08:11:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:11:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 08:11:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 08:11:08,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:08,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051757461] [2024-11-07 08:11:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051757461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:11:08,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446633039] [2024-11-07 08:11:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:08,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:11:08,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:11:08,123 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:11:08,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 08:11:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:08,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 08:11:08,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:11:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 841 proven. 66 refuted. 0 times theorem prover too weak. 1077 trivial. 0 not checked. [2024-11-07 08:11:09,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:11:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 08:11:09,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446633039] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:11:09,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:11:09,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2024-11-07 08:11:09,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111023117] [2024-11-07 08:11:09,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:11:09,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 08:11:09,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:09,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 08:11:09,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:11:09,603 INFO L87 Difference]: Start difference. First operand 372 states and 559 transitions. Second operand has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 6 states have call successors, (96), 3 states have call predecessors, (96), 6 states have return successors, (96), 6 states have call predecessors, (96), 6 states have call successors, (96) [2024-11-07 08:11:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:11,856 INFO L93 Difference]: Finished difference Result 2121 states and 3117 transitions. [2024-11-07 08:11:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-07 08:11:11,857 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 6 states have call successors, (96), 3 states have call predecessors, (96), 6 states have return successors, (96), 6 states have call predecessors, (96), 6 states have call successors, (96) Word has length 204 [2024-11-07 08:11:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:11,875 INFO L225 Difference]: With dead ends: 2121 [2024-11-07 08:11:11,876 INFO L226 Difference]: Without dead ends: 1752 [2024-11-07 08:11:11,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=525, Invalid=1545, Unknown=0, NotChecked=0, Total=2070 [2024-11-07 08:11:11,880 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1056 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:11,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 965 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 08:11:11,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2024-11-07 08:11:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1238. [2024-11-07 08:11:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 779 states have (on average 1.2798459563543003) internal successors, (997), 783 states have internal predecessors, (997), 420 states have call successors, (420), 38 states have call predecessors, (420), 38 states have return successors, (420), 416 states have call predecessors, (420), 420 states have call successors, (420) [2024-11-07 08:11:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1837 transitions. [2024-11-07 08:11:12,109 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1837 transitions. Word has length 204 [2024-11-07 08:11:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:12,110 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1837 transitions. [2024-11-07 08:11:12,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 6 states have call successors, (96), 3 states have call predecessors, (96), 6 states have return successors, (96), 6 states have call predecessors, (96), 6 states have call successors, (96) [2024-11-07 08:11:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1837 transitions. [2024-11-07 08:11:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 08:11:12,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:12,113 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:12,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 08:11:12,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:11:12,314 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:12,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1437370378, now seen corresponding path program 1 times [2024-11-07 08:11:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154704113] [2024-11-07 08:11:12,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:11:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:11:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:11:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:11:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:11:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:11:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 08:11:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:11:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:11:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:11:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:11:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:11:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:11:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:11:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:11:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 08:11:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 08:11:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 08:11:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 08:11:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 08:11:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:11:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 08:11:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 08:11:12,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:12,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154704113] [2024-11-07 08:11:12,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154704113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:12,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:12,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:11:12,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543606904] [2024-11-07 08:11:12,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:12,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:11:12,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:12,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:11:12,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:11:12,912 INFO L87 Difference]: Start difference. First operand 1238 states and 1837 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:11:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:13,464 INFO L93 Difference]: Finished difference Result 1906 states and 2811 transitions. [2024-11-07 08:11:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:11:13,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-11-07 08:11:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:13,482 INFO L225 Difference]: With dead ends: 1906 [2024-11-07 08:11:13,483 INFO L226 Difference]: Without dead ends: 1604 [2024-11-07 08:11:13,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:11:13,488 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 205 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:13,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 274 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:11:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2024-11-07 08:11:13,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 638. [2024-11-07 08:11:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 405 states have (on average 1.2617283950617284) internal successors, (511), 407 states have internal predecessors, (511), 210 states have call successors, (210), 22 states have call predecessors, (210), 22 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-07 08:11:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 931 transitions. [2024-11-07 08:11:13,635 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 931 transitions. Word has length 204 [2024-11-07 08:11:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:13,637 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 931 transitions. [2024-11-07 08:11:13,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 08:11:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 931 transitions. [2024-11-07 08:11:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-07 08:11:13,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:13,639 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:13,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 08:11:13,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:13,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1873733027, now seen corresponding path program 1 times [2024-11-07 08:11:13,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:13,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032786202] [2024-11-07 08:11:13,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:13,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:11:13,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413426445] [2024-11-07 08:11:13,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:13,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:11:13,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:11:13,821 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:11:13,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 08:11:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:11:14,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:11:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:11:14,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:11:14,257 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:11:14,258 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:11:14,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 08:11:14,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:11:14,464 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:11:14,620 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:11:14,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:11:14 BoogieIcfgContainer [2024-11-07 08:11:14,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:11:14,625 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:11:14,625 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:11:14,626 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:11:14,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:10:59" (3/4) ... [2024-11-07 08:11:14,629 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:11:14,630 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:11:14,630 INFO L158 Benchmark]: Toolchain (without parser) took 16075.58ms. Allocated memory was 117.4MB in the beginning and 343.9MB in the end (delta: 226.5MB). Free memory was 91.3MB in the beginning and 237.7MB in the end (delta: -146.4MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2024-11-07 08:11:14,631 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:11:14,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.51ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 74.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:11:14,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.63ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 68.8MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:11:14,631 INFO L158 Benchmark]: Boogie Preprocessor took 91.77ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 59.8MB in the end (delta: 9.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:11:14,632 INFO L158 Benchmark]: RCFGBuilder took 752.46ms. Allocated memory is still 117.4MB. Free memory was 59.6MB in the beginning and 74.1MB in the end (delta: -14.5MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-11-07 08:11:14,632 INFO L158 Benchmark]: TraceAbstraction took 14782.47ms. Allocated memory was 117.4MB in the beginning and 343.9MB in the end (delta: 226.5MB). Free memory was 73.6MB in the beginning and 237.8MB in the end (delta: -164.2MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2024-11-07 08:11:14,632 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 343.9MB. Free memory was 237.8MB in the beginning and 237.7MB in the end (delta: 86.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:11:14,633 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.20ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.51ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 74.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.63ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 68.8MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.77ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 59.8MB in the end (delta: 9.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 752.46ms. Allocated memory is still 117.4MB. Free memory was 59.6MB in the beginning and 74.1MB in the end (delta: -14.5MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14782.47ms. Allocated memory was 117.4MB in the beginning and 343.9MB in the end (delta: 226.5MB). Free memory was 73.6MB in the beginning and 237.8MB in the end (delta: -164.2MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 343.9MB. Free memory was 237.8MB in the beginning and 237.7MB in the end (delta: 86.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 198, overapproximation of someBinaryDOUBLEComparisonOperation at line 198, overapproximation of someUnaryDOUBLEoperation at line 23. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 0; [L23] float var_1_3 = -0.1; [L24] float var_1_4 = 127.25; [L25] float var_1_5 = 2.75; [L26] signed char var_1_6 = 1; [L27] signed char var_1_7 = -2; [L28] signed char var_1_8 = 25; [L29] signed char var_1_9 = 32; [L30] signed char var_1_11 = 0; [L31] signed long int var_1_12 = 2; [L32] unsigned long int var_1_13 = 256; [L33] unsigned long int var_1_16 = 3775050608; [L34] unsigned char var_1_18 = 16; [L35] unsigned char var_1_19 = 100; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 0; [L38] unsigned char var_1_22 = 0; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_24 = 32; [L41] unsigned char var_1_25 = 16; [L42] unsigned char var_1_26 = 32; [L43] unsigned char var_1_27 = 0; [L44] unsigned short int var_1_28 = 4; [L45] unsigned short int var_1_29 = 38930; [L46] unsigned short int var_1_30 = 59162; [L47] unsigned short int var_1_31 = 1; [L48] unsigned short int var_1_32 = 30817; [L49] unsigned long int var_1_33 = 50; [L50] double var_1_34 = 50.25; [L51] double var_1_35 = 10000000000000.75; [L52] unsigned long int last_1_var_1_13 = 256; [L53] unsigned short int last_1_var_1_31 = 1; [L54] unsigned long int last_1_var_1_33 = 50; VAL [isInitial=0, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L193] last_1_var_1_13 = var_1_13 [L194] last_1_var_1_31 = var_1_31 [L195] last_1_var_1_33 = var_1_33 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L205] RET updateLastVariables() [L206] CALL updateVariables() [L141] var_1_3 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L142] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L143] var_1_4 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L144] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L145] var_1_5 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L146] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L147] var_1_6 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L148] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L149] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L149] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L150] var_1_8 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L151] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L152] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L152] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L153] var_1_11 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_11 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L154] RET assume_abort_if_not(var_1_11 >= -126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L155] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L155] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L156] var_1_16 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_16 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L157] RET assume_abort_if_not(var_1_16 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L158] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L158] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L159] var_1_19 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L160] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L161] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L161] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L162] var_1_21 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L163] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L164] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L164] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L165] var_1_24 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L166] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L167] CALL assume_abort_if_not(var_1_24 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L167] RET assume_abort_if_not(var_1_24 <= 64) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L168] var_1_25 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L170] CALL assume_abort_if_not(var_1_25 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L170] RET assume_abort_if_not(var_1_25 <= 63) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L171] var_1_26 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_26 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L172] RET assume_abort_if_not(var_1_26 >= 31) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L173] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L173] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L174] var_1_27 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L175] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L176] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L176] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L177] var_1_29 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L178] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L179] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L179] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L180] var_1_30 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L181] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L182] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L182] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L183] var_1_32 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_32 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L184] RET assume_abort_if_not(var_1_32 >= 16384) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L185] CALL assume_abort_if_not(var_1_32 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L185] RET assume_abort_if_not(var_1_32 <= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L186] var_1_34 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_34 >= -922337.2036854776000e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L187] RET assume_abort_if_not((var_1_34 >= -922337.2036854776000e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L188] var_1_35 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L189] RET assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L190] CALL assume_abort_if_not(var_1_35 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L190] RET assume_abort_if_not(var_1_35 != 0.0F) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L206] RET updateVariables() [L207] CALL step() [L58] COND FALSE !(last_1_var_1_13 > ((((last_1_var_1_31) > (var_1_16)) ? (last_1_var_1_31) : (var_1_16)))) [L61] var_1_28 = (var_1_25 + var_1_19) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L63] COND FALSE !((- var_1_3) <= (var_1_4 - var_1_5)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=0, var_1_9=32] [L70] COND TRUE var_1_4 != var_1_5 [L71] var_1_7 = var_1_6 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L75] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L76] COND FALSE !(var_1_18 > ((32u / var_1_16) + 32u)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L79] COND FALSE !(\read(var_1_21)) [L82] var_1_23 = var_1_27 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L84] COND TRUE var_1_5 <= (- ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) [L85] var_1_31 = ((25454 + var_1_32) - var_1_1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L89] unsigned short int stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_2=58221, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L90] COND FALSE !(stepLocal_2 == var_1_11) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L97] COND TRUE (var_1_31 / var_1_16) <= var_1_28 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L98] COND TRUE var_1_28 <= var_1_18 [L99] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L102] unsigned char stepLocal_1 = var_1_20; [L103] unsigned char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_0=0, stepLocal_1=0, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L104] COND FALSE !(var_1_22 || stepLocal_1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_0=0, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L107] COND FALSE !(var_1_20 && stepLocal_0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L111] signed long int stepLocal_4 = (var_1_6 * var_1_1) / -64; [L112] unsigned short int stepLocal_3 = var_1_28; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_4=0, var_1_11=126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L113] COND TRUE stepLocal_4 >= var_1_28 [L114] var_1_13 = ((((var_1_28) < (var_1_31)) ? (var_1_28) : (var_1_31))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L120] unsigned long int stepLocal_6 = var_1_16; [L121] signed long int stepLocal_5 = (- var_1_18) / var_1_26; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_5=0, stepLocal_6=2147483680, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L122] COND FALSE !(var_1_34 < (var_1_5 / var_1_35)) [L137] var_1_33 = var_1_30 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_5=0, stepLocal_6=2147483680, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L207] RET step() [L208] CALL, EXPR property() [L198-L199] return (((((((((((((- var_1_3) <= (var_1_4 - var_1_5)) ? ((var_1_3 >= (var_1_5 / 255.75f)) ? (var_1_1 == ((signed char) var_1_6)) : (var_1_1 == ((signed char) var_1_6))) : 1) && ((var_1_4 != var_1_5) ? (var_1_7 == ((signed char) var_1_6)) : (var_1_7 == ((signed char) var_1_8)))) && ((var_1_22 || var_1_20) ? (var_1_9 == ((signed char) ((((((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) > (((((-2) < 0 ) ? -(-2) : (-2))))) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (((((-2) < 0 ) ? -(-2) : (-2))))))) > (var_1_6)) ? (((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) > (((((-2) < 0 ) ? -(-2) : (-2))))) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (((((-2) < 0 ) ? -(-2) : (-2))))))) : (var_1_6))))) : ((var_1_20 && var_1_22) ? (var_1_9 == ((signed char) ((((var_1_11) < (var_1_8)) ? (var_1_11) : (var_1_8))))) : 1))) && ((var_1_31 == var_1_11) ? ((! var_1_22) ? (var_1_22 ? (var_1_12 == ((signed long int) var_1_18)) : 1) : 1) : 1)) && ((((var_1_6 * var_1_1) / -64) >= var_1_28) ? (var_1_13 == ((unsigned long int) ((((var_1_28) < (var_1_31)) ? (var_1_28) : (var_1_31))))) : ((50u >= var_1_28) ? (var_1_13 == ((unsigned long int) (var_1_16 - var_1_18))) : 1))) && (var_1_18 == ((unsigned char) var_1_19))) && (((var_1_31 / var_1_16) <= var_1_28) ? ((var_1_28 <= var_1_18) ? (var_1_20 == ((unsigned char) var_1_21)) : 1) : 1)) && ((var_1_18 > ((32u / var_1_16) + 32u)) ? (var_1_22 == ((unsigned char) var_1_21)) : 1)) && (var_1_21 ? (var_1_23 == ((unsigned char) ((var_1_24 + var_1_25) + ((var_1_26 + 32) - var_1_27)))) : (var_1_23 == ((unsigned char) var_1_27)))) && ((last_1_var_1_13 > ((((last_1_var_1_31) > (var_1_16)) ? (last_1_var_1_31) : (var_1_16)))) ? (var_1_28 == ((unsigned short int) (((((var_1_29) > (var_1_30)) ? (var_1_29) : (var_1_30))) - last_1_var_1_33))) : (var_1_28 == ((unsigned short int) (var_1_25 + var_1_19))))) && ((var_1_5 <= (- ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))))) ? (var_1_31 == ((unsigned short int) ((25454 + var_1_32) - var_1_1))) : (var_1_31 == ((unsigned short int) ((((((((var_1_19) < (var_1_23)) ? (var_1_19) : (var_1_23)))) > (var_1_29)) ? (((((var_1_19) < (var_1_23)) ? (var_1_19) : (var_1_23)))) : (var_1_29))))))) && ((var_1_34 < (var_1_5 / var_1_35)) ? ((var_1_16 > ((((64u) < (var_1_28)) ? (64u) : (var_1_28)))) ? (((var_1_4 - var_1_5) <= var_1_3) ? (var_1_33 == ((unsigned long int) (((((8u) < 0 ) ? -(8u) : (8u))) + 25u))) : (var_1_33 == ((unsigned long int) ((((var_1_27) > ((var_1_29 + ((((16u) < (var_1_18)) ? (16u) : (var_1_18)))))) ? (var_1_27) : ((var_1_29 + ((((16u) < (var_1_18)) ? (16u) : (var_1_18)))))))))) : ((((- var_1_18) / var_1_26) < var_1_25) ? (var_1_33 == ((unsigned long int) var_1_30)) : (var_1_33 == ((unsigned long int) var_1_7)))) : (var_1_33 == ((unsigned long int) var_1_30))) ; VAL [\result=0, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=-512, var_1_19=-512, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=1, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=58221, var_1_32=-32769, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 8, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1757 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1713 mSDsluCounter, 2932 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1986 mSDsCounter, 702 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1912 IncrementalHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 702 mSolverCounterUnsat, 946 mSDtfsCounter, 1912 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1375 GetRequests, 1301 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1238occurred in iteration=6, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 7 MinimizatonAttempts, 1652 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2241 NumberOfCodeBlocks, 2241 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2227 ConstructedInterpolants, 0 QuantifiedInterpolants, 7463 SizeOfPredicates, 7 NumberOfNonLiveVariables, 925 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 21473/21824 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:11:14,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.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 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:11:16,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:11:17,009 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:11:17,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:11:17,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:11:17,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:11:17,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:11:17,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:11:17,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:11:17,047 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:11:17,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:11:17,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:11:17,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:11:17,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:11:17,048 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:11:17,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:11:17,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:11:17,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:11:17,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:11:17,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:11:17,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:11:17,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:11:17,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:11:17,050 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:11:17,050 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:11:17,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:11:17,051 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:11:17,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:11:17,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:11:17,051 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:11:17,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:11:17,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:11:17,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:11:17,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:11:17,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:11:17,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:11:17,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:11:17,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:11:17,053 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:11:17,053 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:11:17,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:11:17,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:11:17,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:11:17,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:11:17,054 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 -> 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf [2024-11-07 08:11:17,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:11:17,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:11:17,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:11:17,350 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:11:17,352 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:11:17,354 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-51.i [2024-11-07 08:11:18,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:11:19,027 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:11:19,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-11-07 08:11:19,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fef2685de/5671c7c0dfbe4a8fbb0d330de6760f5b/FLAG8782a0e7c [2024-11-07 08:11:19,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fef2685de/5671c7c0dfbe4a8fbb0d330de6760f5b [2024-11-07 08:11:19,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:11:19,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:11:19,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:11:19,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:11:19,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:11:19,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:11:19" (1/1) ... [2024-11-07 08:11:19,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b232591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19, skipping insertion in model container [2024-11-07 08:11:19,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:11:19" (1/1) ... [2024-11-07 08:11:19,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:11:19,228 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-51.i[916,929] [2024-11-07 08:11:19,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:11:19,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:11:19,374 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-51.i[916,929] [2024-11-07 08:11:19,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:11:19,457 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:11:19,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19 WrapperNode [2024-11-07 08:11:19,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:11:19,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:11:19,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:11:19,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:11:19,468 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:11:19" (1/1) ... [2024-11-07 08:11:19,486 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:11:19" (1/1) ... [2024-11-07 08:11:19,527 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-07 08:11:19,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:11:19,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:11:19,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:11:19,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:11:19,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19" (1/1) ... [2024-11-07 08:11:19,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19" (1/1) ... [2024-11-07 08:11:19,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19" (1/1) ... [2024-11-07 08:11:19,563 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:11:19,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19" (1/1) ... [2024-11-07 08:11:19,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19" (1/1) ... [2024-11-07 08:11:19,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19" (1/1) ... [2024-11-07 08:11:19,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19" (1/1) ... [2024-11-07 08:11:19,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19" (1/1) ... [2024-11-07 08:11:19,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19" (1/1) ... [2024-11-07 08:11:19,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:11:19,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:11:19,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:11:19,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:11:19,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19" (1/1) ... [2024-11-07 08:11:19,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:11:19,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:11:19,645 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:11:19,652 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:11:19,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:11:19,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:11:19,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:11:19,673 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:11:19,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:11:19,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:11:19,757 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:11:19,759 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:11:33,525 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-07 08:11:33,526 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:11:33,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:11:33,538 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:11:33,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:11:33 BoogieIcfgContainer [2024-11-07 08:11:33,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:11:33,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:11:33,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:11:33,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:11:33,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:11:19" (1/3) ... [2024-11-07 08:11:33,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95d5a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:11:33, skipping insertion in model container [2024-11-07 08:11:33,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:19" (2/3) ... [2024-11-07 08:11:33,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95d5a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:11:33, skipping insertion in model container [2024-11-07 08:11:33,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:11:33" (3/3) ... [2024-11-07 08:11:33,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-51.i [2024-11-07 08:11:33,561 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:11:33,562 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:11:33,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:11:33,628 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;@2843c157, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:11:33,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:11:33,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:11:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:11:33,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:33,652 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:33,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:33,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:33,657 INFO L85 PathProgramCache]: Analyzing trace with hash 37560582, now seen corresponding path program 1 times [2024-11-07 08:11:33,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:11:33,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614923203] [2024-11-07 08:11:33,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:33,671 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:11:33,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:11:33,676 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:11:33,678 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:11:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:34,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:11:34,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:11:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1490 trivial. 0 not checked. [2024-11-07 08:11:34,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:11:34,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:11:34,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614923203] [2024-11-07 08:11:34,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614923203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:34,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:34,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:11:34,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982151023] [2024-11-07 08:11:34,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:34,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:11:34,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:11:34,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:11:34,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:11:34,814 INFO L87 Difference]: Start difference. First operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:11:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:34,851 INFO L93 Difference]: Finished difference Result 181 states and 322 transitions. [2024-11-07 08:11:34,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:11:34,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-07 08:11:34,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:34,862 INFO L225 Difference]: With dead ends: 181 [2024-11-07 08:11:34,864 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 08:11:34,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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:11:34,870 INFO L432 NwaCegarLoop]: 141 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, 141 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:11:34,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:11:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 08:11:34,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-07 08:11:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:11:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2024-11-07 08:11:34,915 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 203 [2024-11-07 08:11:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:34,916 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2024-11-07 08:11:34,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 08:11:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2024-11-07 08:11:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:11:34,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:34,919 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:34,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 08:11:35,119 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:11:35,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:35,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash 653297218, now seen corresponding path program 1 times [2024-11-07 08:11:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:11:35,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700684256] [2024-11-07 08:11:35,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:35,122 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:11:35,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:11:35,124 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:11:35,127 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:11:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:36,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 08:11:36,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:11:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-11-07 08:11:40,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:11:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 08:11:45,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:11:45,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700684256] [2024-11-07 08:11:45,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700684256] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:11:45,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:11:45,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 08:11:45,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972321608] [2024-11-07 08:11:45,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:11:45,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:11:45,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:11:45,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:11:45,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:11:45,909 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-07 08:11:54,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:11:58,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:12:02,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:12:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:12:02,621 INFO L93 Difference]: Finished difference Result 185 states and 286 transitions. [2024-11-07 08:12:02,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:12:02,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 203 [2024-11-07 08:12:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:12:02,804 INFO L225 Difference]: With dead ends: 185 [2024-11-07 08:12:02,804 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 08:12:02,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:12:02,806 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 127 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 34 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:12:02,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 241 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 173 Invalid, 3 Unknown, 0 Unchecked, 16.1s Time] [2024-11-07 08:12:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 08:12:02,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-07 08:12:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 59 states have internal predecessors, (79), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 08:12:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 143 transitions. [2024-11-07 08:12:02,832 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 143 transitions. Word has length 203 [2024-11-07 08:12:02,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:12:02,833 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 143 transitions. [2024-11-07 08:12:02,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-07 08:12:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 143 transitions. [2024-11-07 08:12:02,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 08:12:02,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:12:02,838 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:02,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:12:03,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:12:03,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:12:03,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:12:03,040 INFO L85 PathProgramCache]: Analyzing trace with hash -626566460, now seen corresponding path program 1 times [2024-11-07 08:12:03,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:12:03,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274457024] [2024-11-07 08:12:03,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:03,041 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:12:03,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:12:03,044 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:12:03,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:12:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:03,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 08:12:03,975 INFO L278 TraceCheckSpWp]: Computing forward predicates...