./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.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', '586631ca404c1b537cc1b6f6da4a014826fc10fbc299a5b43a0d3245229f10ab'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.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 586631ca404c1b537cc1b6f6da4a014826fc10fbc299a5b43a0d3245229f10ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:07:56,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:07:56,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:07:56,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:07:56,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:07:56,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:07:56,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:07:56,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:07:56,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:07:56,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:07:56,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:07:56,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:07:56,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:07:56,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:07:56,393 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:07:56,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:07:56,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:07:56,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:07:56,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:07:56,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:07:56,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:07:56,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:07:56,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:07:56,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:07:56,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:07:56,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:07:56,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:07:56,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:07:56,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:07:56,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:07:56,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:07:56,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:07:56,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:07:56,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:07:56,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:07:56,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:07:56,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:07:56,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:07:56,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:07:56,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:07:56,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:07:56,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:07:56,396 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 -> 586631ca404c1b537cc1b6f6da4a014826fc10fbc299a5b43a0d3245229f10ab [2024-11-07 06:07:56,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:07:56,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:07:56,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:07:56,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:07:56,744 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:07:56,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i [2024-11-07 06:07:58,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:07:58,334 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:07:58,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i [2024-11-07 06:07:58,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d4aca9bf/c2ea2f5d79a64a31a46bed90d98faa17/FLAGd919715c3 [2024-11-07 06:07:58,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d4aca9bf/c2ea2f5d79a64a31a46bed90d98faa17 [2024-11-07 06:07:58,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:07:58,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:07:58,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:07:58,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:07:58,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:07:58,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58db7211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58, skipping insertion in model container [2024-11-07 06:07:58,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:07:58,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i[919,932] [2024-11-07 06:07:58,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:07:58,630 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:07:58,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i[919,932] [2024-11-07 06:07:58,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:07:58,695 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:07:58,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58 WrapperNode [2024-11-07 06:07:58,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:07:58,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:07:58,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:07:58,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:07:58,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,782 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-11-07 06:07:58,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:07:58,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:07:58,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:07:58,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:07:58,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,829 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 06:07:58,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:07:58,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:07:58,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:07:58,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:07:58,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (1/1) ... [2024-11-07 06:07:58,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:07:58,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:07:58,917 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 06:07:58,922 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 06:07:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:07:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:07:58,947 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:07:58,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:07:58,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:07:58,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:07:59,057 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:07:59,059 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:07:59,643 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 06:07:59,643 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:07:59,656 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:07:59,658 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:07:59,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:07:59 BoogieIcfgContainer [2024-11-07 06:07:59,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:07:59,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:07:59,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:07:59,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:07:59,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:07:58" (1/3) ... [2024-11-07 06:07:59,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@807e914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:07:59, skipping insertion in model container [2024-11-07 06:07:59,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:07:58" (2/3) ... [2024-11-07 06:07:59,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@807e914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:07:59, skipping insertion in model container [2024-11-07 06:07:59,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:07:59" (3/3) ... [2024-11-07 06:07:59,670 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i [2024-11-07 06:07:59,685 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:07:59,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:07:59,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:07:59,768 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;@4049009, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:07:59,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:07:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:07:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 06:07:59,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:07:59,796 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:07:59,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:07:59,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:07:59,802 INFO L85 PathProgramCache]: Analyzing trace with hash 321680098, now seen corresponding path program 1 times [2024-11-07 06:07:59,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:07:59,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78451618] [2024-11-07 06:07:59,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:07:59,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:08:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:08:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:08:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:08:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:08:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:08:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:08:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:08:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:08:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:08:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:08:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:08:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:08:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:08:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:08:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:08:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:08:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:08:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:08:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:08:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:08:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:08:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:08:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:08:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:00,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:08:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:01,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:08:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:01,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:08:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:01,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:08:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:01,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:08:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:01,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:08:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:01,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:08:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:01,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:08:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:01,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:08:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:08:01,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:08:01,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78451618] [2024-11-07 06:08:01,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78451618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:08:01,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:08:01,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:08:01,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699967732] [2024-11-07 06:08:01,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:08:01,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:08:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:08:01,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:08:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:08:01,101 INFO L87 Difference]: Start difference. First operand has 105 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:08:01,811 INFO L93 Difference]: Finished difference Result 486 states and 929 transitions. [2024-11-07 06:08:01,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:08:01,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-07 06:08:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:08:01,828 INFO L225 Difference]: With dead ends: 486 [2024-11-07 06:08:01,829 INFO L226 Difference]: Without dead ends: 384 [2024-11-07 06:08:01,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:08:01,842 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 415 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:08:01,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 573 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:08:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-07 06:08:01,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 220. [2024-11-07 06:08:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 153 states have (on average 1.4444444444444444) internal successors, (221), 153 states have internal predecessors, (221), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:08:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 349 transitions. [2024-11-07 06:08:01,956 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 349 transitions. Word has length 207 [2024-11-07 06:08:01,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:08:01,961 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 349 transitions. [2024-11-07 06:08:01,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 349 transitions. [2024-11-07 06:08:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 06:08:01,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:08:01,967 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:08:01,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:08:01,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:08:01,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:08:01,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2010623840, now seen corresponding path program 1 times [2024-11-07 06:08:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:08:01,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369691033] [2024-11-07 06:08:01,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:08:01,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:08:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:08:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:08:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:08:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:08:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:08:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:08:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:08:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:08:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:08:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:08:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:08:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:08:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:08:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:08:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:08:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:08:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:08:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:08:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:08:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:08:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:08:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:08:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:08:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:08:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:08:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:08:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:08:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:08:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:08:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:08:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:08:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:08:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:08:02,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:08:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369691033] [2024-11-07 06:08:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369691033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:08:02,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:08:02,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:08:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871544439] [2024-11-07 06:08:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:08:02,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:08:02,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:08:02,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:08:02,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:08:02,570 INFO L87 Difference]: Start difference. First operand 220 states and 349 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:08:03,036 INFO L93 Difference]: Finished difference Result 545 states and 861 transitions. [2024-11-07 06:08:03,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:08:03,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-07 06:08:03,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:08:03,040 INFO L225 Difference]: With dead ends: 545 [2024-11-07 06:08:03,040 INFO L226 Difference]: Without dead ends: 328 [2024-11-07 06:08:03,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:08:03,042 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 253 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:08:03,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 563 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:08:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-07 06:08:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 238. [2024-11-07 06:08:03,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 171 states have (on average 1.4619883040935673) internal successors, (250), 171 states have internal predecessors, (250), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:08:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 378 transitions. [2024-11-07 06:08:03,123 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 378 transitions. Word has length 207 [2024-11-07 06:08:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:08:03,124 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 378 transitions. [2024-11-07 06:08:03,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 378 transitions. [2024-11-07 06:08:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 06:08:03,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:08:03,133 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:08:03,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:08:03,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:08:03,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:08:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2047922080, now seen corresponding path program 1 times [2024-11-07 06:08:03,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:08:03,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675534473] [2024-11-07 06:08:03,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:08:03,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:08:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:08:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:08:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:08:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:08:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:08:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:08:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:08:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:08:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:08:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:08:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:08:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:08:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:08:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:08:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:08:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:08:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:08:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:08:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:08:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:08:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:08:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:08:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:08:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:08:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:08:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:08:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:08:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:08:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:08:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:08:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:08:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:08:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:08:03,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:08:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675534473] [2024-11-07 06:08:03,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675534473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:08:03,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:08:03,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:08:03,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723948935] [2024-11-07 06:08:03,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:08:03,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:08:03,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:08:03,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:08:03,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:08:03,782 INFO L87 Difference]: Start difference. First operand 238 states and 378 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:08:04,379 INFO L93 Difference]: Finished difference Result 560 states and 887 transitions. [2024-11-07 06:08:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:08:04,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-07 06:08:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:08:04,384 INFO L225 Difference]: With dead ends: 560 [2024-11-07 06:08:04,384 INFO L226 Difference]: Without dead ends: 325 [2024-11-07 06:08:04,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:08:04,386 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 352 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 06:08:04,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 435 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 06:08:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-07 06:08:04,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 219. [2024-11-07 06:08:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 152 states have internal predecessors, (219), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:08:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 347 transitions. [2024-11-07 06:08:04,428 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 347 transitions. Word has length 207 [2024-11-07 06:08:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:08:04,429 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 347 transitions. [2024-11-07 06:08:04,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 347 transitions. [2024-11-07 06:08:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 06:08:04,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:08:04,434 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:08:04,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:08:04,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:08:04,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:08:04,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2042946884, now seen corresponding path program 1 times [2024-11-07 06:08:04,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:08:04,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528324906] [2024-11-07 06:08:04,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:08:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:08:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:08:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:08:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:08:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:08:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:08:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:08:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:08:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:08:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:08:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:08:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:08:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:08:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:08:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:08:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:08:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:08:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:08:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:08:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:08:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:08:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:08:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:08:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:08:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:08:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:08:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:08:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:08:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:08:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:08:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:08:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:08:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:08:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:08:04,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:08:04,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528324906] [2024-11-07 06:08:04,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528324906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:08:04,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:08:04,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:08:04,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745256279] [2024-11-07 06:08:04,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:08:04,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:08:04,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:08:04,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:08:04,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:08:04,792 INFO L87 Difference]: Start difference. First operand 219 states and 347 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:08:05,322 INFO L93 Difference]: Finished difference Result 868 states and 1371 transitions. [2024-11-07 06:08:05,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:08:05,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-11-07 06:08:05,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:08:05,337 INFO L225 Difference]: With dead ends: 868 [2024-11-07 06:08:05,337 INFO L226 Difference]: Without dead ends: 770 [2024-11-07 06:08:05,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:08:05,339 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 507 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:08:05,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 595 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:08:05,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-11-07 06:08:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 242. [2024-11-07 06:08:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 175 states have (on average 1.457142857142857) internal successors, (255), 175 states have internal predecessors, (255), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:08:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 383 transitions. [2024-11-07 06:08:05,421 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 383 transitions. Word has length 208 [2024-11-07 06:08:05,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:08:05,422 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 383 transitions. [2024-11-07 06:08:05,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 383 transitions. [2024-11-07 06:08:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 06:08:05,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:08:05,425 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:08:05,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:08:05,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:08:05,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:08:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash -972156734, now seen corresponding path program 1 times [2024-11-07 06:08:05,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:08:05,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284939764] [2024-11-07 06:08:05,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:08:05,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:08:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:08:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:08:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:08:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:08:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:08:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:08:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:08:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:08:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:08:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:08:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:08:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:08:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:08:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:08:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:08:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:08:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:08:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:08:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:08:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:08:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:08:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:08:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:08:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:08:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:08:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:08:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:08:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:08:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:08:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:08:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:08:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:08:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:08:05,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:08:05,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284939764] [2024-11-07 06:08:05,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284939764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:08:05,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:08:05,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 06:08:05,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942865597] [2024-11-07 06:08:05,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:08:05,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:08:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:08:05,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:08:05,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:08:05,818 INFO L87 Difference]: Start difference. First operand 242 states and 383 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:06,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:08:06,552 INFO L93 Difference]: Finished difference Result 918 states and 1452 transitions. [2024-11-07 06:08:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:08:06,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-11-07 06:08:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:08:06,560 INFO L225 Difference]: With dead ends: 918 [2024-11-07 06:08:06,560 INFO L226 Difference]: Without dead ends: 797 [2024-11-07 06:08:06,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:08:06,562 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 464 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:08:06,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 917 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:08:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-07 06:08:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 252. [2024-11-07 06:08:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 185 states have (on average 1.4702702702702704) internal successors, (272), 185 states have internal predecessors, (272), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:08:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 400 transitions. [2024-11-07 06:08:06,632 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 400 transitions. Word has length 208 [2024-11-07 06:08:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:08:06,636 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 400 transitions. [2024-11-07 06:08:06,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 400 transitions. [2024-11-07 06:08:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 06:08:06,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:08:06,639 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:08:06,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:08:06,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:08:06,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:08:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash -563076670, now seen corresponding path program 1 times [2024-11-07 06:08:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:08:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764487459] [2024-11-07 06:08:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:08:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:08:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:08:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:08:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:08:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:08:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:08:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:08:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:08:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:08:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:08:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:08:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:08:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:08:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:08:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:08:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:08:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:08:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:08:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:08:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:08:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:08:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:08:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:08:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:08:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:08:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:08:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:08:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:08:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:08:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:08:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:08:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:08:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:08:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:08:06,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:08:06,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764487459] [2024-11-07 06:08:06,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764487459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:08:06,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:08:06,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:08:06,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674406195] [2024-11-07 06:08:06,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:08:06,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:08:06,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:08:06,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:08:06,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:08:06,942 INFO L87 Difference]: Start difference. First operand 252 states and 400 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:08:07,415 INFO L93 Difference]: Finished difference Result 740 states and 1168 transitions. [2024-11-07 06:08:07,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:08:07,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-11-07 06:08:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:08:07,424 INFO L225 Difference]: With dead ends: 740 [2024-11-07 06:08:07,424 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 06:08:07,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:08:07,429 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 269 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:08:07,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 556 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:08:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 06:08:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 270. [2024-11-07 06:08:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 203 states have (on average 1.4876847290640394) internal successors, (302), 203 states have internal predecessors, (302), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:08:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 430 transitions. [2024-11-07 06:08:07,491 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 430 transitions. Word has length 208 [2024-11-07 06:08:07,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:08:07,491 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 430 transitions. [2024-11-07 06:08:07,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 430 transitions. [2024-11-07 06:08:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 06:08:07,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:08:07,494 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:08:07,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 06:08:07,495 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:08:07,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:08:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash -326655294, now seen corresponding path program 1 times [2024-11-07 06:08:07,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:08:07,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534639593] [2024-11-07 06:08:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:08:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:08:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:08:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:08:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:08:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:08:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:08:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:08:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:08:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:08:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:08:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:08:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:08:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:08:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:08:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:08:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:08:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:08:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:08:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:08:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:08:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:08:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:08:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:08:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:08:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:08:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:08:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:08:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:08:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:08:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:08:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:08:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:08:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:08:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:08:07,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:08:07,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534639593] [2024-11-07 06:08:07,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534639593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:08:07,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:08:07,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:08:07,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298832552] [2024-11-07 06:08:07,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:08:07,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:08:07,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:08:07,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:08:07,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:08:07,907 INFO L87 Difference]: Start difference. First operand 270 states and 430 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:08:08,336 INFO L93 Difference]: Finished difference Result 894 states and 1416 transitions. [2024-11-07 06:08:08,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:08:08,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-11-07 06:08:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:08:08,342 INFO L225 Difference]: With dead ends: 894 [2024-11-07 06:08:08,342 INFO L226 Difference]: Without dead ends: 627 [2024-11-07 06:08:08,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:08:08,344 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 280 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:08:08,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 543 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:08:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-07 06:08:08,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 254. [2024-11-07 06:08:08,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 187 states have (on average 1.46524064171123) internal successors, (274), 187 states have internal predecessors, (274), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:08:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 402 transitions. [2024-11-07 06:08:08,396 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 402 transitions. Word has length 208 [2024-11-07 06:08:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:08:08,396 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 402 transitions. [2024-11-07 06:08:08,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 402 transitions. [2024-11-07 06:08:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 06:08:08,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:08:08,398 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:08:08,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:08:08,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:08:08,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:08:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash 716787008, now seen corresponding path program 1 times [2024-11-07 06:08:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:08:08,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616918885] [2024-11-07 06:08:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:08:08,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:08:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:08:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:08:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:08:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:08:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:08:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:08:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:08:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:08:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:08:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:08:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:08:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:08:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:08:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:08:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:08:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:08:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:08:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:08:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:08:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:08:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:08:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:08:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:08:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:08:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:08:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:08:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:08:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:08:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:08:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:08:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:08:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:08:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:08:08,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:08:08,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616918885] [2024-11-07 06:08:08,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616918885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:08:08,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:08:08,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 06:08:08,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180544724] [2024-11-07 06:08:08,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:08:08,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 06:08:08,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:08:08,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 06:08:08,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:08:08,734 INFO L87 Difference]: Start difference. First operand 254 states and 402 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:08:09,521 INFO L93 Difference]: Finished difference Result 787 states and 1241 transitions. [2024-11-07 06:08:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 06:08:09,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-11-07 06:08:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:08:09,530 INFO L225 Difference]: With dead ends: 787 [2024-11-07 06:08:09,530 INFO L226 Difference]: Without dead ends: 655 [2024-11-07 06:08:09,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:08:09,531 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 276 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:08:09,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 741 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:08:09,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-11-07 06:08:09,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 254. [2024-11-07 06:08:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 187 states have (on average 1.46524064171123) internal successors, (274), 187 states have internal predecessors, (274), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:08:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 402 transitions. [2024-11-07 06:08:09,575 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 402 transitions. Word has length 208 [2024-11-07 06:08:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:08:09,576 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 402 transitions. [2024-11-07 06:08:09,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:08:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 402 transitions. [2024-11-07 06:08:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 06:08:09,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:08:09,579 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:08:09,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 06:08:09,579 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:08:09,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:08:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2114723999, now seen corresponding path program 1 times [2024-11-07 06:08:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:08:09,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985308111] [2024-11-07 06:08:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:08:09,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:08:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:08:09,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087768930] [2024-11-07 06:08:09,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:08:09,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:08:09,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:08:09,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:08:09,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 06:08:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:08:09,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:08:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:08:10,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:08:10,205 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:08:10,206 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:08:10,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 06:08:10,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:08:10,415 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:08:10,592 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:08:10,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:08:10 BoogieIcfgContainer [2024-11-07 06:08:10,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:08:10,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:08:10,600 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:08:10,601 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:08:10,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:07:59" (3/4) ... [2024-11-07 06:08:10,604 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:08:10,605 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:08:10,607 INFO L158 Benchmark]: Toolchain (without parser) took 12243.97ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 76.7MB in the beginning and 127.0MB in the end (delta: -50.3MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2024-11-07 06:08:10,607 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:08:10,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.03ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 60.7MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:08:10,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.81ms. Allocated memory is still 100.7MB. Free memory was 60.7MB in the beginning and 56.5MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:08:10,608 INFO L158 Benchmark]: Boogie Preprocessor took 91.63ms. Allocated memory is still 100.7MB. Free memory was 56.5MB in the beginning and 51.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:08:10,609 INFO L158 Benchmark]: RCFGBuilder took 782.79ms. Allocated memory is still 100.7MB. Free memory was 51.1MB in the beginning and 59.5MB in the end (delta: -8.4MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-07 06:08:10,609 INFO L158 Benchmark]: TraceAbstraction took 10934.07ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 59.0MB in the beginning and 127.0MB in the end (delta: -68.0MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2024-11-07 06:08:10,609 INFO L158 Benchmark]: Witness Printer took 5.25ms. Allocated memory is still 234.9MB. Free memory was 127.0MB in the beginning and 127.0MB in the end (delta: 29.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:08:10,611 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.31ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.03ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 60.7MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.81ms. Allocated memory is still 100.7MB. Free memory was 60.7MB in the beginning and 56.5MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 91.63ms. Allocated memory is still 100.7MB. Free memory was 56.5MB in the beginning and 51.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 782.79ms. Allocated memory is still 100.7MB. Free memory was 51.1MB in the beginning and 59.5MB in the end (delta: -8.4MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10934.07ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 59.0MB in the beginning and 127.0MB in the end (delta: -68.0MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. * Witness Printer took 5.25ms. Allocated memory is still 234.9MB. Free memory was 127.0MB in the beginning and 127.0MB in the end (delta: 29.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 194, overapproximation of someBinaryDOUBLEComparisonOperation at line 194. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 256; [L23] unsigned short int var_1_2 = 51640; [L24] unsigned short int var_1_3 = 5; [L25] float var_1_7 = 128.8; [L26] unsigned char var_1_8 = 2; [L27] float var_1_9 = 256.5; [L28] float var_1_10 = 7.25; [L29] signed char var_1_11 = 64; [L30] signed char var_1_12 = -16; [L31] double var_1_13 = 0.9; [L32] unsigned char var_1_14 = 1; [L33] double var_1_15 = 0.0; [L34] double var_1_16 = 1.275; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 35331; [L37] signed char var_1_19 = -128; [L38] double var_1_20 = 0.0; [L39] double var_1_21 = 0.0; [L40] signed char var_1_22 = -8; [L41] signed char var_1_23 = 50; [L42] signed char var_1_26 = 5; [L43] signed long int var_1_27 = 32; [L44] unsigned char var_1_28 = 64; [L45] signed char var_1_29 = 100; [L46] signed char var_1_30 = -1; [L47] signed char var_1_31 = 10; [L48] signed char var_1_32 = 5; [L49] signed char var_1_33 = 1; [L50] unsigned short int var_1_34 = 32; [L51] unsigned char var_1_35 = 1; [L52] signed long int var_1_36 = -8; [L53] unsigned char var_1_37 = 1; [L54] float last_1_var_1_10 = 7.25; [L55] double last_1_var_1_13 = 0.9; [L56] unsigned short int last_1_var_1_17 = 8; [L57] signed char last_1_var_1_19 = -128; VAL [isInitial=0, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=51640, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L198] isInitial = 1 [L199] FCALL initially() [L200] COND TRUE 1 [L201] CALL updateLastVariables() [L188] last_1_var_1_10 = var_1_10 [L189] last_1_var_1_13 = var_1_13 [L190] last_1_var_1_17 = var_1_17 [L191] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=51640, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L201] RET updateLastVariables() [L202] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L137] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L139] var_1_3 = __VERIFIER_nondet_ushort() [L140] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L140] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L141] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L141] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L142] var_1_8 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_9=513/2] [L143] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_9=513/2] [L144] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_9=513/2] [L144] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_9=513/2] [L145] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L145] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L146] var_1_9 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L147] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L148] var_1_12 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L149] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L150] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L150] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L151] var_1_14 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L152] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L153] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L153] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L154] var_1_15 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L155] RET assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L156] var_1_16 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L157] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L158] var_1_18 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_18 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L159] RET assume_abort_if_not(var_1_18 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L160] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L160] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L161] var_1_20 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L162] RET assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L163] var_1_21 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L164] RET assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L165] var_1_22 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L166] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L167] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L167] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L168] var_1_26 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L169] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L170] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L170] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L171] var_1_30 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L172] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L173] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L173] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L174] var_1_31 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L176] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L176] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L177] var_1_33 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L178] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L179] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L179] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L180] var_1_35 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L181] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L182] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L182] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L183] var_1_37 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L184] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L185] CALL assume_abort_if_not(var_1_37 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L185] RET assume_abort_if_not(var_1_37 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L202] RET updateVariables() [L203] CALL step() [L61] signed long int stepLocal_2 = var_1_3 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L62] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L73] COND TRUE var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16)) [L74] var_1_19 = ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-32769, var_1_19=0, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L78] var_1_17 = (var_1_18 - var_1_3) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L79] COND TRUE (var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10) [L80] var_1_10 = var_1_9 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L82] COND FALSE !(var_1_10 >= var_1_10) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L87] COND FALSE !((var_1_2 - var_1_3) > var_1_17) [L90] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L92] signed long int stepLocal_1 = var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))); [L93] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_1=0, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L94] COND FALSE !((var_1_19 / var_1_8) < stepLocal_1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L101] COND TRUE (~ (- var_1_17)) < var_1_1 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L102] COND FALSE !(var_1_1 < -64) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L106] COND FALSE !(var_1_17 > var_1_11) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L109] COND TRUE var_1_17 <= (((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) < 0 ) ? -((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) : ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) [L110] var_1_28 = 4 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L112] COND TRUE var_1_26 <= 16 [L113] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_31) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L115] COND TRUE var_1_11 >= var_1_11 [L116] var_1_32 = ((((4) < (((((var_1_26) < ((var_1_31 - var_1_33))) ? (var_1_26) : ((var_1_31 - var_1_33)))))) ? (4) : (((((var_1_26) < ((var_1_31 - var_1_33))) ? (var_1_26) : ((var_1_31 - var_1_33))))))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L120] EXPR var_1_11 & var_1_19 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L120] EXPR (var_1_11 & var_1_19) ^ var_1_11 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L120] EXPR var_1_11 & var_1_33 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L120] COND FALSE !(((var_1_11 & var_1_19) ^ var_1_11) < (var_1_11 & var_1_33)) [L125] EXPR var_1_17 & (~ var_1_11) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L125] COND TRUE (var_1_17 & (~ var_1_11)) <= var_1_1 [L126] COND TRUE \read(var_1_35) [L127] var_1_36 = ((((var_1_11) > (((((var_1_1) < (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? (var_1_1) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))))))) ? (var_1_11) : (((((var_1_1) < (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? (var_1_1) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))))))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=64, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L203] RET step() [L204] CALL, EXPR property() [L194-L195] return ((((((((var_1_2 - var_1_3) > var_1_17) ? (var_1_1 == ((signed long int) (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))))) : (var_1_1 == ((signed long int) 0))) && (((var_1_19 / var_1_8) < (var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))))) ? ((var_1_1 >= var_1_3) ? (var_1_7 == ((float) 0.75f)) : (var_1_7 == ((float) var_1_9))) : 1)) && (((var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10)) ? (var_1_10 == ((float) var_1_9)) : 1)) && ((var_1_10 >= var_1_10) ? ((var_1_9 < var_1_10) ? (var_1_11 == ((signed char) var_1_12)) : 1) : 1)) && (var_1_14 ? ((last_1_var_1_13 <= var_1_9) ? (var_1_13 == ((double) var_1_9)) : ((((((last_1_var_1_17) < ((var_1_2 * last_1_var_1_17))) ? (last_1_var_1_17) : ((var_1_2 * last_1_var_1_17)))) == (var_1_3 + last_1_var_1_19)) ? (var_1_13 == ((double) 8.75)) : (var_1_13 == ((double) (16.5 + ((var_1_15 - 49.35) - var_1_16)))))) : 1)) && (var_1_17 == ((unsigned short int) (var_1_18 - var_1_3)))) && ((var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16))) ? (var_1_19 == ((signed char) ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))))) : (var_1_19 == ((signed char) var_1_12))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=64, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L204] RET, EXPR property() [L204] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=64, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-32769, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=64, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 9, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2816 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2816 mSDsluCounter, 4923 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2566 mSDsCounter, 287 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2451 IncrementalHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 287 mSolverCounterUnsat, 2357 mSDtfsCounter, 2451 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 2546 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2077 NumberOfCodeBlocks, 2077 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1653 ConstructedInterpolants, 0 QuantifiedInterpolants, 2754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 15872/15872 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 06:08:10,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.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 586631ca404c1b537cc1b6f6da4a014826fc10fbc299a5b43a0d3245229f10ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:08:13,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:08:13,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:08:13,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:08:13,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:08:13,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:08:13,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:08:13,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:08:13,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:08:13,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:08:13,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:08:13,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:08:13,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:08:13,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:08:13,251 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:08:13,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:08:13,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:08:13,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:08:13,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:08:13,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:08:13,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:08:13,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:08:13,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:08:13,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:08:13,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:08:13,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:08:13,253 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:08:13,253 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:08:13,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:08:13,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:08:13,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:08:13,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:08:13,253 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 -> 586631ca404c1b537cc1b6f6da4a014826fc10fbc299a5b43a0d3245229f10ab [2024-11-07 06:08:13,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:08:13,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:08:13,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:08:13,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:08:13,613 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:08:13,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i [2024-11-07 06:08:15,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:08:15,364 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:08:15,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i [2024-11-07 06:08:15,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adb8f7a12/9491f68795f841cd908f618ea53ca80e/FLAG8d2b2ec72 [2024-11-07 06:08:15,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adb8f7a12/9491f68795f841cd908f618ea53ca80e [2024-11-07 06:08:15,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:08:15,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:08:15,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:08:15,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:08:15,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:08:15,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4036d044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15, skipping insertion in model container [2024-11-07 06:08:15,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:08:15,597 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i[919,932] [2024-11-07 06:08:15,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:08:15,714 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:08:15,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i[919,932] [2024-11-07 06:08:15,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:08:15,796 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:08:15,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15 WrapperNode [2024-11-07 06:08:15,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:08:15,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:08:15,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:08:15,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:08:15,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,876 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-11-07 06:08:15,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:08:15,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:08:15,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:08:15,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:08:15,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,926 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 06:08:15,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:08:15,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:08:15,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:08:15,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:08:15,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (1/1) ... [2024-11-07 06:08:15,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:08:15,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:08:16,007 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 06:08:16,011 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 06:08:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:08:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:08:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:08:16,037 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:08:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:08:16,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:08:16,144 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:08:16,146 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:08:28,833 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 06:08:28,833 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:08:28,843 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:08:28,844 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:08:28,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:08:28 BoogieIcfgContainer [2024-11-07 06:08:28,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:08:28,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:08:28,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:08:28,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:08:28,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:08:15" (1/3) ... [2024-11-07 06:08:28,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c972870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:08:28, skipping insertion in model container [2024-11-07 06:08:28,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:08:15" (2/3) ... [2024-11-07 06:08:28,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c972870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:08:28, skipping insertion in model container [2024-11-07 06:08:28,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:08:28" (3/3) ... [2024-11-07 06:08:28,854 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i [2024-11-07 06:08:28,869 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:08:28,870 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:08:28,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:08:28,937 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;@1fd58d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:08:28,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:08:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:08:28,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 06:08:28,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:08:28,965 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:08:28,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:08:28,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:08:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1663782051, now seen corresponding path program 1 times [2024-11-07 06:08:28,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:08:28,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162642778] [2024-11-07 06:08:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:08:28,980 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 06:08:28,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:08:28,983 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 06:08:28,984 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 06:08:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:29,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:08:29,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:08:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-07 06:08:29,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:08:29,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:08:29,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162642778] [2024-11-07 06:08:29,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162642778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:08:29,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:08:29,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:08:29,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333936166] [2024-11-07 06:08:29,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:08:29,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:08:29,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:08:29,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:08:29,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:08:29,814 INFO L87 Difference]: Start difference. First operand has 92 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:08:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:08:29,842 INFO L93 Difference]: Finished difference Result 177 states and 320 transitions. [2024-11-07 06:08:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:08:29,844 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-07 06:08:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:08:29,855 INFO L225 Difference]: With dead ends: 177 [2024-11-07 06:08:29,856 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 06:08:29,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:08:29,868 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:08:29,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:08:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 06:08:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-07 06:08:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:08:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 137 transitions. [2024-11-07 06:08:29,928 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 137 transitions. Word has length 203 [2024-11-07 06:08:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:08:29,929 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 137 transitions. [2024-11-07 06:08:29,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:08:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 137 transitions. [2024-11-07 06:08:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 06:08:29,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:08:29,934 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:08:29,959 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 06:08:30,134 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 06:08:30,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:08:30,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:08:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1635893599, now seen corresponding path program 1 times [2024-11-07 06:08:30,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:08:30,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987002225] [2024-11-07 06:08:30,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:08:30,137 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 06:08:30,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:08:30,140 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 06:08:30,143 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 06:08:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:08:30,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:08:30,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:08:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 768 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2024-11-07 06:08:42,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:08:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 06:08:45,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:08:45,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987002225] [2024-11-07 06:08:45,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987002225] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:08:45,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:08:45,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-07 06:08:45,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491196474] [2024-11-07 06:08:45,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:08:45,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:08:45,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:08:45,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:08:45,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:08:45,613 INFO L87 Difference]: Start difference. First operand 88 states and 137 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2024-11-07 06:08:52,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:08:56,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:08:57,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:09:01,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:09:05,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:09:09,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:09:13,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:09:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:09:13,532 INFO L93 Difference]: Finished difference Result 179 states and 276 transitions. [2024-11-07 06:09:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:09:13,603 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) Word has length 203 [2024-11-07 06:09:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:09:13,605 INFO L225 Difference]: With dead ends: 179 [2024-11-07 06:09:13,606 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 06:09:13,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2024-11-07 06:09:13,608 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 184 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 136 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:09:13,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 199 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 204 Invalid, 4 Unknown, 0 Unchecked, 26.4s Time] [2024-11-07 06:09:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 06:09:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2024-11-07 06:09:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:09:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 139 transitions. [2024-11-07 06:09:13,630 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 139 transitions. Word has length 203 [2024-11-07 06:09:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:09:13,631 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 139 transitions. [2024-11-07 06:09:13,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2024-11-07 06:09:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 139 transitions. [2024-11-07 06:09:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 06:09:13,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:09:13,637 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:09:13,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 06:09:13,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:09:13,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:09:13,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:09:13,843 INFO L85 PathProgramCache]: Analyzing trace with hash -989970195, now seen corresponding path program 1 times [2024-11-07 06:09:13,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:09:13,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090496027] [2024-11-07 06:09:13,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:09:13,843 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 06:09:13,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:09:13,846 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:09:13,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 06:09:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:09:14,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:09:14,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:09:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:09:14,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:09:14,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:09:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090496027] [2024-11-07 06:09:14,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090496027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:09:14,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:09:14,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:09:14,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542553471] [2024-11-07 06:09:14,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:09:14,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:09:14,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:09:14,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:09:14,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:09:14,520 INFO L87 Difference]: Start difference. First operand 92 states and 139 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:09:18,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:09:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:09:18,973 INFO L93 Difference]: Finished difference Result 197 states and 297 transitions. [2024-11-07 06:09:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:09:18,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-11-07 06:09:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:09:18,977 INFO L225 Difference]: With dead ends: 197 [2024-11-07 06:09:18,977 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 06:09:18,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:09:18,982 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 55 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:09:18,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 245 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-11-07 06:09:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 06:09:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-07 06:09:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.265625) internal successors, (81), 65 states have internal predecessors, (81), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 06:09:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2024-11-07 06:09:19,010 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 204 [2024-11-07 06:09:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:09:19,012 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2024-11-07 06:09:19,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:09:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2024-11-07 06:09:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 06:09:19,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:09:19,017 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:09:19,051 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 (4)] Ended with exit code 0 [2024-11-07 06:09:19,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:09:19,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:09:19,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:09:19,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2011038549, now seen corresponding path program 1 times [2024-11-07 06:09:19,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:09:19,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811373692] [2024-11-07 06:09:19,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:09:19,220 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 06:09:19,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:09:19,224 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:09:19,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 06:09:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:09:19,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 06:09:19,821 INFO L278 TraceCheckSpWp]: Computing forward predicates...