./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.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_codestructure_normal_file-65.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', '42c6423785198dd4a043b6ffb8b15bc58abdd425ee3b16bee994e5bca051a506'] 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_codestructure_normal_file-65.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 42c6423785198dd4a043b6ffb8b15bc58abdd425ee3b16bee994e5bca051a506 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:12:05,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:12:05,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:12:05,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:12:05,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:12:05,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:12:05,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:12:05,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:12:05,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:12:05,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:12:05,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:12:05,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:12:05,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:12:05,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:12:05,977 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:12:05,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:12:05,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:12:05,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:12:05,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:12:05,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:12:05,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:12:05,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:12:05,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:12:05,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:12:05,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:12:05,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:12:05,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:12:05,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:12:05,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:12:05,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:12:05,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:12:05,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:12:05,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:12:05,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:12:05,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:12:05,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:12:05,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:12:05,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:12:05,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:12:05,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:12:05,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:12:05,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:12:05,979 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 -> 42c6423785198dd4a043b6ffb8b15bc58abdd425ee3b16bee994e5bca051a506 [2024-11-07 04:12:06,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:12:06,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:12:06,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:12:06,215 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:12:06,216 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:12:06,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i [2024-11-07 04:12:07,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:12:07,554 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:12:07,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i [2024-11-07 04:12:07,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/585e7bebe/0ebf4ec3da41478f8fbe22acde2c496c/FLAGb07a8f790 [2024-11-07 04:12:07,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/585e7bebe/0ebf4ec3da41478f8fbe22acde2c496c [2024-11-07 04:12:07,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:12:07,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:12:07,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:12:07,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:12:07,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:12:07,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d482a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07, skipping insertion in model container [2024-11-07 04:12:07,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:12:07,713 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_codestructure_normal_file-65.i[913,926] [2024-11-07 04:12:07,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:12:07,770 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:12:07,778 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_codestructure_normal_file-65.i[913,926] [2024-11-07 04:12:07,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:12:07,810 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:12:07,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07 WrapperNode [2024-11-07 04:12:07,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:12:07,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:12:07,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:12:07,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:12:07,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,863 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2024-11-07 04:12:07,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:12:07,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:12:07,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:12:07,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:12:07,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,900 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 04:12:07,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:12:07,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:12:07,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:12:07,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:12:07,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (1/1) ... [2024-11-07 04:12:07,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:12:07,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:12:07,950 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 04:12:07,952 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 04:12:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:12:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:12:07,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:12:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:12:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:12:07,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:12:08,041 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:12:08,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:12:08,333 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 04:12:08,333 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:12:08,342 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:12:08,344 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:12:08,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:12:08 BoogieIcfgContainer [2024-11-07 04:12:08,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:12:08,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:12:08,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:12:08,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:12:08,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:12:07" (1/3) ... [2024-11-07 04:12:08,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4380fe59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:12:08, skipping insertion in model container [2024-11-07 04:12:08,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:07" (2/3) ... [2024-11-07 04:12:08,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4380fe59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:12:08, skipping insertion in model container [2024-11-07 04:12:08,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:12:08" (3/3) ... [2024-11-07 04:12:08,354 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-65.i [2024-11-07 04:12:08,365 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:12:08,365 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:12:08,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:12:08,415 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;@76208665, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:12:08,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:12:08,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 66 states have (on average 1.378787878787879) internal successors, (91), 67 states have internal predecessors, (91), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:12:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-07 04:12:08,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:12:08,433 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:08,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:12:08,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:12:08,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1073306205, now seen corresponding path program 1 times [2024-11-07 04:12:08,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:12:08,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120601742] [2024-11-07 04:12:08,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:12:08,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:12:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:12:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:12:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:12:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:12:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:12:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:12:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:12:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:12:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:12:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:12:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:12:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:12:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:12:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:12:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:12:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:12:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:12:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:12:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:12:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:12:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:12:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:12:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:12:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:12:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:12:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 04:12:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 04:12:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:12:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 04:12:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:12:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 04:12:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:12:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 04:12:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 04:12:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-07 04:12:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-07 04:12:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 04:12:10,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:12:10,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120601742] [2024-11-07 04:12:10,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120601742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:12:10,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:12:10,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:12:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343388668] [2024-11-07 04:12:10,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:12:10,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:12:10,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:12:10,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:12:10,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:12:10,193 INFO L87 Difference]: Start difference. First operand has 105 states, 66 states have (on average 1.378787878787879) internal successors, (91), 67 states have internal predecessors, (91), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 04:12:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:12:10,578 INFO L93 Difference]: Finished difference Result 240 states and 415 transitions. [2024-11-07 04:12:10,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:12:10,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-11-07 04:12:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:12:10,586 INFO L225 Difference]: With dead ends: 240 [2024-11-07 04:12:10,586 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 04:12:10,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 04:12:10,590 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 44 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:12:10,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 467 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 04:12:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 04:12:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2024-11-07 04:12:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:12:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 186 transitions. [2024-11-07 04:12:10,641 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 186 transitions. Word has length 222 [2024-11-07 04:12:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:12:10,643 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 186 transitions. [2024-11-07 04:12:10,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 04:12:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 186 transitions. [2024-11-07 04:12:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-07 04:12:10,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:12:10,646 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:10,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:12:10,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:12:10,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:12:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1633313189, now seen corresponding path program 1 times [2024-11-07 04:12:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:12:10,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157824313] [2024-11-07 04:12:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:12:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:12:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:12:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:12:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:12:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:12:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:12:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:12:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:12:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:12:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:12:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:12:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:12:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:12:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:12:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:12:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:12:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:12:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:12:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:12:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:12:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:12:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:12:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:12:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:12:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:12:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:12:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 04:12:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 04:12:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:12:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 04:12:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:12:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 04:12:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:12:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 04:12:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 04:12:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-07 04:12:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-07 04:12:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 04:12:12,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:12:12,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157824313] [2024-11-07 04:12:12,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157824313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:12:12,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:12:12,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:12:12,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211527525] [2024-11-07 04:12:12,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:12:12,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:12:12,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:12:12,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:12:12,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:12:12,652 INFO L87 Difference]: Start difference. First operand 119 states and 186 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 04:12:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:12:13,000 INFO L93 Difference]: Finished difference Result 335 states and 521 transitions. [2024-11-07 04:12:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:12:13,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-11-07 04:12:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:12:13,003 INFO L225 Difference]: With dead ends: 335 [2024-11-07 04:12:13,003 INFO L226 Difference]: Without dead ends: 219 [2024-11-07 04:12:13,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 04:12:13,004 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 121 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:12:13,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 387 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 04:12:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-07 04:12:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 126. [2024-11-07 04:12:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 88 states have internal predecessors, (127), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:12:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 199 transitions. [2024-11-07 04:12:13,023 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 199 transitions. Word has length 222 [2024-11-07 04:12:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:12:13,023 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 199 transitions. [2024-11-07 04:12:13,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 04:12:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 199 transitions. [2024-11-07 04:12:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-07 04:12:13,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:12:13,028 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:13,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:12:13,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:12:13,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:12:13,029 INFO L85 PathProgramCache]: Analyzing trace with hash 54733125, now seen corresponding path program 1 times [2024-11-07 04:12:13,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:12:13,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960184175] [2024-11-07 04:12:13,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:12:13,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:12:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:12:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:12:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:12:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:12:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:12:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:12:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:12:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:12:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:12:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:12:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:12:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:12:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:12:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:12:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:12:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:12:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:12:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:12:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:12:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:12:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:12:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:12:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:12:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:12:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:12:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 04:12:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 04:12:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:12:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 04:12:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:12:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 04:12:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:12:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 04:12:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 04:12:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-07 04:12:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-07 04:12:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 04:12:17,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:12:17,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960184175] [2024-11-07 04:12:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960184175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:12:17,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:12:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 04:12:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328322588] [2024-11-07 04:12:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:12:17,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 04:12:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:12:17,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 04:12:17,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 04:12:17,455 INFO L87 Difference]: Start difference. First operand 126 states and 199 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, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 04:12:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:12:17,800 INFO L93 Difference]: Finished difference Result 326 states and 505 transitions. [2024-11-07 04:12:17,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 04:12:17,800 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, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 223 [2024-11-07 04:12:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:12:17,802 INFO L225 Difference]: With dead ends: 326 [2024-11-07 04:12:17,802 INFO L226 Difference]: Without dead ends: 203 [2024-11-07 04:12:17,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:12:17,803 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 164 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:12:17,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 474 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 04:12:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-07 04:12:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 125. [2024-11-07 04:12:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 87 states have internal predecessors, (123), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:12:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 195 transitions. [2024-11-07 04:12:17,812 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 195 transitions. Word has length 223 [2024-11-07 04:12:17,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:12:17,812 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 195 transitions. [2024-11-07 04:12:17,812 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, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 04:12:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 195 transitions. [2024-11-07 04:12:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-07 04:12:17,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:12:17,814 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:17,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:12:17,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:12:17,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:12:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash -966335229, now seen corresponding path program 1 times [2024-11-07 04:12:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:12:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651072054] [2024-11-07 04:12:17,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:12:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:12:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:12:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:12:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:12:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:12:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:12:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:12:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:12:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:12:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:12:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:12:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:12:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:12:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:12:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:12:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:12:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:12:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:12:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:12:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:12:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:12:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:12:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:12:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:12:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:12:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:12:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 04:12:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 04:12:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:12:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 04:12:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:12:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 04:12:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:12:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 04:12:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 04:12:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-07 04:12:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-07 04:12:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 04:12:19,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:12:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651072054] [2024-11-07 04:12:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651072054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:12:19,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:12:19,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 04:12:19,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219214112] [2024-11-07 04:12:19,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:12:19,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 04:12:19,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:12:19,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 04:12:19,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 04:12:19,685 INFO L87 Difference]: Start difference. First operand 125 states and 195 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, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 04:12:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:12:20,059 INFO L93 Difference]: Finished difference Result 308 states and 471 transitions. [2024-11-07 04:12:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 04:12:20,059 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, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 223 [2024-11-07 04:12:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:12:20,062 INFO L225 Difference]: With dead ends: 308 [2024-11-07 04:12:20,062 INFO L226 Difference]: Without dead ends: 186 [2024-11-07 04:12:20,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:12:20,063 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 131 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:12:20,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 438 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 04:12:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-07 04:12:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 108. [2024-11-07 04:12:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:12:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 167 transitions. [2024-11-07 04:12:20,075 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 167 transitions. Word has length 223 [2024-11-07 04:12:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:12:20,076 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 167 transitions. [2024-11-07 04:12:20,076 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, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 04:12:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 167 transitions. [2024-11-07 04:12:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-07 04:12:20,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:12:20,078 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:20,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:12:20,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:12:20,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:12:20,079 INFO L85 PathProgramCache]: Analyzing trace with hash -541055234, now seen corresponding path program 1 times [2024-11-07 04:12:20,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:12:20,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400124167] [2024-11-07 04:12:20,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:12:20,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:12:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:12:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:12:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:12:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:12:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:12:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:12:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:12:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:12:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:12:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:12:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:12:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:12:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:12:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:12:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:12:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:12:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:12:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:12:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:12:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:12:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:12:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:12:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:12:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:12:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:12:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 04:12:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 04:12:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:12:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 04:12:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:12:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 04:12:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:12:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 04:12:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 04:12:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-07 04:12:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-07 04:12:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 04:12:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:12:20,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400124167] [2024-11-07 04:12:20,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400124167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:12:20,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:12:20,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:12:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441064772] [2024-11-07 04:12:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:12:20,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:12:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:12:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:12:20,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:12:20,316 INFO L87 Difference]: Start difference. First operand 108 states and 167 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 04:12:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:12:20,562 INFO L93 Difference]: Finished difference Result 369 states and 569 transitions. [2024-11-07 04:12:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:12:20,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 224 [2024-11-07 04:12:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:12:20,568 INFO L225 Difference]: With dead ends: 369 [2024-11-07 04:12:20,568 INFO L226 Difference]: Without dead ends: 264 [2024-11-07 04:12:20,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:12:20,569 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 187 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:12:20,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 434 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:12:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-07 04:12:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 259. [2024-11-07 04:12:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 175 states have (on average 1.3771428571428572) internal successors, (241), 176 states have internal predecessors, (241), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-07 04:12:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 401 transitions. [2024-11-07 04:12:20,592 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 401 transitions. Word has length 224 [2024-11-07 04:12:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:12:20,594 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 401 transitions. [2024-11-07 04:12:20,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 04:12:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 401 transitions. [2024-11-07 04:12:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-07 04:12:20,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:12:20,596 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:20,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:12:20,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:12:20,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:12:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash -282889796, now seen corresponding path program 1 times [2024-11-07 04:12:20,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:12:20,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223806646] [2024-11-07 04:12:20,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:12:20,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:12:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:12:20,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:12:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:12:20,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:12:20,755 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:12:20,756 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:12:20,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 04:12:20,760 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 04:12:20,847 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:12:20,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:12:20 BoogieIcfgContainer [2024-11-07 04:12:20,849 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:12:20,850 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:12:20,850 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:12:20,850 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:12:20,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:12:08" (3/4) ... [2024-11-07 04:12:20,855 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:12:20,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:12:20,856 INFO L158 Benchmark]: Toolchain (without parser) took 13276.99ms. Allocated memory was 109.1MB in the beginning and 629.1MB in the end (delta: 520.1MB). Free memory was 85.5MB in the beginning and 361.1MB in the end (delta: -275.6MB). Peak memory consumption was 243.7MB. Max. memory is 16.1GB. [2024-11-07 04:12:20,856 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:12:20,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.00ms. Allocated memory is still 109.1MB. Free memory was 85.4MB in the beginning and 70.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:12:20,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.26ms. Allocated memory is still 109.1MB. Free memory was 70.8MB in the beginning and 67.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:12:20,857 INFO L158 Benchmark]: Boogie Preprocessor took 50.42ms. Allocated memory is still 109.1MB. Free memory was 67.0MB in the beginning and 63.0MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:12:20,857 INFO L158 Benchmark]: RCFGBuilder took 423.39ms. Allocated memory is still 109.1MB. Free memory was 63.0MB in the beginning and 81.2MB in the end (delta: -18.2MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-07 04:12:20,857 INFO L158 Benchmark]: TraceAbstraction took 12502.92ms. Allocated memory was 109.1MB in the beginning and 629.1MB in the end (delta: 520.1MB). Free memory was 80.7MB in the beginning and 361.3MB in the end (delta: -280.6MB). Peak memory consumption was 238.7MB. Max. memory is 16.1GB. [2024-11-07 04:12:20,857 INFO L158 Benchmark]: Witness Printer took 5.84ms. Allocated memory is still 629.1MB. Free memory was 361.3MB in the beginning and 361.1MB in the end (delta: 165.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:12:20,858 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.25ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.00ms. Allocated memory is still 109.1MB. Free memory was 85.4MB in the beginning and 70.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.26ms. Allocated memory is still 109.1MB. Free memory was 70.8MB in the beginning and 67.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.42ms. Allocated memory is still 109.1MB. Free memory was 67.0MB in the beginning and 63.0MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 423.39ms. Allocated memory is still 109.1MB. Free memory was 63.0MB in the beginning and 81.2MB in the end (delta: -18.2MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12502.92ms. Allocated memory was 109.1MB in the beginning and 629.1MB in the end (delta: 520.1MB). Free memory was 80.7MB in the beginning and 361.3MB in the end (delta: -280.6MB). Peak memory consumption was 238.7MB. Max. memory is 16.1GB. * Witness Printer took 5.84ms. Allocated memory is still 629.1MB. Free memory was 361.3MB in the beginning and 361.1MB in the end (delta: 165.1kB). 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 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryArithmeticDOUBLEoperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_2 = 16; [L24] unsigned short int var_1_3 = 100; [L25] unsigned short int var_1_4 = 10; [L26] signed short int var_1_5 = 256; [L27] signed short int var_1_6 = -10; [L28] signed short int var_1_7 = -25; [L29] unsigned short int var_1_8 = 64; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 1; [L32] unsigned short int var_1_11 = 256; [L33] unsigned short int var_1_12 = 0; [L34] unsigned short int var_1_13 = 64; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 0; [L37] signed char var_1_16 = 50; [L38] float var_1_17 = 8.25; [L39] float var_1_18 = 1.25; [L40] signed char var_1_19 = -100; [L41] double var_1_20 = 100000000.8; [L42] double var_1_21 = 15.125; [L43] double var_1_22 = 99.22; [L44] signed long int var_1_23 = -16; [L45] unsigned char var_1_24 = 1; [L46] signed char var_1_25 = 10; [L47] signed char var_1_26 = 16; [L48] unsigned char var_1_27 = 0; [L49] double var_1_28 = 5.5; VAL [isInitial=0, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_2=16, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L153] isInitial = 1 [L154] FCALL initially() [L155] COND TRUE 1 [L156] FCALL updateLastVariables() [L157] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L91] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L92] var_1_3 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L94] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L95] var_1_4 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L97] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L98] var_1_5 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L99] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L100] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L101] var_1_6 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_6 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L102] RET assume_abort_if_not(var_1_6 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_6 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L103] RET assume_abort_if_not(var_1_6 <= 8192) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L104] var_1_7 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_7 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L105] RET assume_abort_if_not(var_1_7 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_7 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_7 <= 8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L107] var_1_9 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64] [L108] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64] [L109] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L110] var_1_10 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L111] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L112] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L113] var_1_11 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L115] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L116] var_1_12 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L117] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L119] var_1_13 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L120] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L122] var_1_15 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L123] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L125] var_1_17 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L126] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L127] var_1_18 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L128] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L129] var_1_19 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L130] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L131] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L131] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L132] var_1_21 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L133] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L134] var_1_22 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L135] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L136] var_1_25 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L137] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L138] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L139] var_1_26 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L140] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L141] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L142] var_1_27 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L143] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L144] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L157] RET updateVariables() [L158] CALL step() [L53] COND TRUE (var_1_2 <= var_1_3) || (var_1_4 > 4) [L54] var_1_1 = (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L58] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L63] EXPR var_1_6 ^ var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L63] COND FALSE !(var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) [L66] COND FALSE !(var_1_1 < var_1_4) [L77] var_1_16 = 100 VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L79] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L80] EXPR ((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6 VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L80] COND FALSE !((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) [L83] var_1_23 = ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16))) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_23=32767, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L85] var_1_24 = ((var_1_16 <= (var_1_25 - var_1_26)) && var_1_27) [L86] var_1_28 = var_1_21 VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L158] RET step() [L159] CALL, EXPR property() [L149] EXPR ((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L149] EXPR var_1_6 ^ var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L149] EXPR ((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L149] EXPR (((((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1)) && ((var_1_1 < var_1_4) ? (((! (var_1_10 || var_1_9)) && var_1_14) ? ((((((2.75f) > (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f))))) ? (2.75f) : (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f)))))) != var_1_18) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16)))))) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L149-L150] return (((((((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1)) && ((var_1_1 < var_1_4) ? (((! (var_1_10 || var_1_9)) && var_1_14) ? ((((((2.75f) > (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f))))) ? (2.75f) : (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f)))))) != var_1_18) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16))))))) && (var_1_24 == ((unsigned char) ((var_1_16 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L159] RET, EXPR property() [L159] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=5, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-8186, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 6, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 647 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 647 mSDsluCounter, 2200 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1511 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1155 IncrementalHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 689 mSDtfsCounter, 1155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 273 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1338 NumberOfCodeBlocks, 1338 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1109 ConstructedInterpolants, 0 QuantifiedInterpolants, 7601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 12600/12600 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 04:12:20,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.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 42c6423785198dd4a043b6ffb8b15bc58abdd425ee3b16bee994e5bca051a506 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:12:22,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:12:22,736 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:12:22,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:12:22,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:12:22,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:12:22,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:12:22,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:12:22,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:12:22,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:12:22,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:12:22,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:12:22,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:12:22,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:12:22,767 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:12:22,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:12:22,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:12:22,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:12:22,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:12:22,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:12:22,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:12:22,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:12:22,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:12:22,769 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:12:22,769 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:12:22,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:12:22,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:12:22,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:12:22,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:12:22,769 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 -> 42c6423785198dd4a043b6ffb8b15bc58abdd425ee3b16bee994e5bca051a506 [2024-11-07 04:12:22,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:12:23,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:12:23,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:12:23,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:12:23,004 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:12:23,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i [2024-11-07 04:12:24,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:12:24,354 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:12:24,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i [2024-11-07 04:12:24,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cf265f0a/402d845ff2ec4a8b866288cc12966f75/FLAG37cb20e0e [2024-11-07 04:12:24,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cf265f0a/402d845ff2ec4a8b866288cc12966f75 [2024-11-07 04:12:24,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:12:24,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:12:24,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:12:24,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:12:24,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:12:24,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@324788b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24, skipping insertion in model container [2024-11-07 04:12:24,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:12:24,507 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_codestructure_normal_file-65.i[913,926] [2024-11-07 04:12:24,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:12:24,550 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:12:24,558 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_codestructure_normal_file-65.i[913,926] [2024-11-07 04:12:24,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:12:24,592 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:12:24,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24 WrapperNode [2024-11-07 04:12:24,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:12:24,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:12:24,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:12:24,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:12:24,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,625 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-07 04:12:24,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:12:24,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:12:24,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:12:24,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:12:24,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,658 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 04:12:24,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:12:24,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:12:24,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:12:24,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:12:24,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (1/1) ... [2024-11-07 04:12:24,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:12:24,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:12:24,717 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 04:12:24,722 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 04:12:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:12:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:12:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:12:24,739 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:12:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:12:24,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:12:24,817 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:12:24,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:12:26,150 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 04:12:26,150 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:12:26,156 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:12:26,156 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:12:26,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:12:26 BoogieIcfgContainer [2024-11-07 04:12:26,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:12:26,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:12:26,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:12:26,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:12:26,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:12:24" (1/3) ... [2024-11-07 04:12:26,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73341da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:12:26, skipping insertion in model container [2024-11-07 04:12:26,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:24" (2/3) ... [2024-11-07 04:12:26,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73341da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:12:26, skipping insertion in model container [2024-11-07 04:12:26,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:12:26" (3/3) ... [2024-11-07 04:12:26,167 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-65.i [2024-11-07 04:12:26,178 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:12:26,178 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:12:26,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:12:26,234 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;@7dd9f5c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:12:26,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:12:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:12:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-07 04:12:26,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:12:26,253 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:26,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:12:26,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:12:26,259 INFO L85 PathProgramCache]: Analyzing trace with hash 774270407, now seen corresponding path program 1 times [2024-11-07 04:12:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:12:26,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796884495] [2024-11-07 04:12:26,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:12:26,271 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 04:12:26,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:12:26,274 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 04:12:26,277 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 04:12:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:26,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:12:26,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:12:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2024-11-07 04:12:26,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:12:26,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:12:26,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796884495] [2024-11-07 04:12:26,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796884495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:12:26,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:12:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:12:26,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427103606] [2024-11-07 04:12:26,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:12:26,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:12:26,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:12:26,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:12:26,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:12:26,646 INFO L87 Difference]: Start difference. First operand has 85 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-07 04:12:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:12:26,672 INFO L93 Difference]: Finished difference Result 163 states and 292 transitions. [2024-11-07 04:12:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:12:26,674 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 216 [2024-11-07 04:12:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:12:26,679 INFO L225 Difference]: With dead ends: 163 [2024-11-07 04:12:26,679 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 04:12:26,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 215 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 04:12:26,685 INFO L432 NwaCegarLoop]: 124 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, 124 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 04:12:26,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:12:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 04:12:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 04:12:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:12:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2024-11-07 04:12:26,729 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 216 [2024-11-07 04:12:26,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:12:26,729 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2024-11-07 04:12:26,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-07 04:12:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2024-11-07 04:12:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-07 04:12:26,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:12:26,732 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:26,741 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 04:12:26,933 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 04:12:26,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:12:26,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:12:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1334882887, now seen corresponding path program 1 times [2024-11-07 04:12:26,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:12:26,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585784673] [2024-11-07 04:12:26,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:12:26,935 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 04:12:26,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:12:26,938 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 04:12:26,939 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 04:12:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:12:27,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-07 04:12:27,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:13:00,482 WARN L286 SmtUtils]: Spent 9.70s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 04:13:25,251 WARN L286 SmtUtils]: Spent 9.08s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)