./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d'] 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-pr-ci_file-8.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:24:08,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:24:08,578 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:24:08,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:24:08,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:24:08,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:24:08,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:24:08,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:24:08,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:24:08,621 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:24:08,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:24:08,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:24:08,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:24:08,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:24:08,622 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:24:08,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:24:08,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:24:08,623 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:24:08,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:24:08,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:24:08,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:24:08,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:24:08,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:24:08,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:24:08,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:24:08,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:24:08,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:24:08,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:24:08,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:24:08,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:24:08,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:24:08,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:24:08,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:24:08,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:24:08,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:24:08,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:24:08,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:24:08,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:24:08,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:24:08,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:24:08,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:24:08,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:24:08,627 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 -> 3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d [2024-11-07 06:24:08,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:24:08,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:24:08,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:24:08,941 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:24:08,941 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:24:08,943 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-pr-ci_file-8.i [2024-11-07 06:24:10,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:24:10,544 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:24:10,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-11-07 06:24:10,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f7945110/4e0c00af748d4f78a937166c096b7dd1/FLAGf06fafbb3 [2024-11-07 06:24:10,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f7945110/4e0c00af748d4f78a937166c096b7dd1 [2024-11-07 06:24:10,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:24:10,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:24:10,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:24:10,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:24:10,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:24:10,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:24:10" (1/1) ... [2024-11-07 06:24:10,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b70307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:10, skipping insertion in model container [2024-11-07 06:24:10,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:24:10" (1/1) ... [2024-11-07 06:24:10,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:24:11,023 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-pr-ci_file-8.i[918,931] [2024-11-07 06:24:11,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:24:11,109 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:24:11,121 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-pr-ci_file-8.i[918,931] [2024-11-07 06:24:11,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:24:11,179 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:24:11,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:11 WrapperNode [2024-11-07 06:24:11,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:24:11,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:24:11,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:24:11,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:24:11,190 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:24:11" (1/1) ... [2024-11-07 06:24:11,206 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:24:11" (1/1) ... [2024-11-07 06:24:11,270 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-07 06:24:11,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:24:11,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:24:11,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:24:11,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:24:11,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:11" (1/1) ... [2024-11-07 06:24:11,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:11" (1/1) ... [2024-11-07 06:24:11,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:11" (1/1) ... [2024-11-07 06:24:11,319 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:24:11,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:11" (1/1) ... [2024-11-07 06:24:11,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:11" (1/1) ... [2024-11-07 06:24:11,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:11" (1/1) ... [2024-11-07 06:24:11,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:11" (1/1) ... [2024-11-07 06:24:11,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:11" (1/1) ... [2024-11-07 06:24:11,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:11" (1/1) ... [2024-11-07 06:24:11,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:24:11,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:24:11,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:24:11,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:24:11,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:11" (1/1) ... [2024-11-07 06:24:11,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:24:11,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:24:11,407 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:24:11,414 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:24:11,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:24:11,436 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:24:11,437 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:24:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:24:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:24:11,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:24:11,528 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:24:11,530 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:24:12,076 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 06:24:12,077 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:24:12,091 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:24:12,093 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:24:12,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:24:12 BoogieIcfgContainer [2024-11-07 06:24:12,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:24:12,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:24:12,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:24:12,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:24:12,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:24:10" (1/3) ... [2024-11-07 06:24:12,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2890fccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:24:12, skipping insertion in model container [2024-11-07 06:24:12,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:11" (2/3) ... [2024-11-07 06:24:12,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2890fccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:24:12, skipping insertion in model container [2024-11-07 06:24:12,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:24:12" (3/3) ... [2024-11-07 06:24:12,106 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-11-07 06:24:12,121 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:24:12,121 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:24:12,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:24:12,183 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;@3cd0eded, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:24:12,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:24:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 59 states have internal predecessors, (91), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:24:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 06:24:12,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:24:12,200 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:12,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:24:12,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:24:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1638019198, now seen corresponding path program 1 times [2024-11-07 06:24:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:24:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694269958] [2024-11-07 06:24:12,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:12,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:24:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:24:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:24:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 06:24:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:24:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:24:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:24:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:24:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:24:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:24:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:24:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:24:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:24:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:24:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:24:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:24:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:24:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:24:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:24:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:24:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:24:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:24:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:24:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:24:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:24:12,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:24:12,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694269958] [2024-11-07 06:24:12,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694269958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:24:12,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:24:12,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:24:12,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702925559] [2024-11-07 06:24:12,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:24:12,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:24:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:24:12,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:24:12,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:24:12,778 INFO L87 Difference]: Start difference. First operand has 84 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 59 states have internal predecessors, (91), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 06:24:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:24:12,816 INFO L93 Difference]: Finished difference Result 161 states and 291 transitions. [2024-11-07 06:24:12,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:24:12,819 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2024-11-07 06:24:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:24:12,826 INFO L225 Difference]: With dead ends: 161 [2024-11-07 06:24:12,827 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 06:24:12,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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:24:12,838 INFO L432 NwaCegarLoop]: 129 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, 129 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:24:12,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:24:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 06:24:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-07 06:24:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.509090909090909) internal successors, (83), 55 states have internal predecessors, (83), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:24:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 129 transitions. [2024-11-07 06:24:12,898 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 129 transitions. Word has length 150 [2024-11-07 06:24:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:24:12,899 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 129 transitions. [2024-11-07 06:24:12,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 06:24:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 129 transitions. [2024-11-07 06:24:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 06:24:12,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:24:12,905 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:12,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:24:12,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:24:12,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:24:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1143957380, now seen corresponding path program 1 times [2024-11-07 06:24:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:24:12,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773810629] [2024-11-07 06:24:12,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:12,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:24:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:24:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:24:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 06:24:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:24:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:24:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:24:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:24:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:24:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:24:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:24:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:24:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:24:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:24:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:24:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:24:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:14,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:24:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:24:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:15,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:24:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:24:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:15,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:24:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:15,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:24:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:15,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:24:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:24:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 06:24:15,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:24:15,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773810629] [2024-11-07 06:24:15,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773810629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:24:15,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683640379] [2024-11-07 06:24:15,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:15,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:24:15,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:24:15,111 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:24:15,113 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:24:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:15,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 06:24:15,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:24:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-07 06:24:16,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:24:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-07 06:24:17,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683640379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:24:17,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:24:17,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 33 [2024-11-07 06:24:17,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142634365] [2024-11-07 06:24:17,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:24:17,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-07 06:24:17,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:24:17,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-07 06:24:17,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 06:24:17,343 INFO L87 Difference]: Start difference. First operand 80 states and 129 transitions. Second operand has 33 states, 32 states have (on average 3.59375) internal successors, (115), 31 states have internal predecessors, (115), 9 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 9 states have call predecessors, (69), 9 states have call successors, (69) [2024-11-07 06:24:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:24:35,203 INFO L93 Difference]: Finished difference Result 2486 states and 3703 transitions. [2024-11-07 06:24:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 336 states. [2024-11-07 06:24:35,203 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.59375) internal successors, (115), 31 states have internal predecessors, (115), 9 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 9 states have call predecessors, (69), 9 states have call successors, (69) Word has length 150 [2024-11-07 06:24:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:24:35,226 INFO L225 Difference]: With dead ends: 2486 [2024-11-07 06:24:35,226 INFO L226 Difference]: Without dead ends: 2409 [2024-11-07 06:24:35,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55710 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=19095, Invalid=103755, Unknown=0, NotChecked=0, Total=122850 [2024-11-07 06:24:35,264 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 4865 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 3745 mSolverCounterSat, 2540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4901 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 6285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2540 IncrementalHoareTripleChecker+Valid, 3745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:24:35,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4901 Valid, 2889 Invalid, 6285 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2540 Valid, 3745 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-07 06:24:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2024-11-07 06:24:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 1508. [2024-11-07 06:24:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 996 states have (on average 1.428714859437751) internal successors, (1423), 1014 states have internal predecessors, (1423), 455 states have call successors, (455), 56 states have call predecessors, (455), 56 states have return successors, (455), 437 states have call predecessors, (455), 455 states have call successors, (455) [2024-11-07 06:24:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2333 transitions. [2024-11-07 06:24:35,580 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2333 transitions. Word has length 150 [2024-11-07 06:24:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:24:35,581 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 2333 transitions. [2024-11-07 06:24:35,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.59375) internal successors, (115), 31 states have internal predecessors, (115), 9 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 9 states have call predecessors, (69), 9 states have call successors, (69) [2024-11-07 06:24:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2333 transitions. [2024-11-07 06:24:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 06:24:35,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:24:35,588 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:35,610 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:24:35,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:24:35,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:24:35,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:24:35,790 INFO L85 PathProgramCache]: Analyzing trace with hash 334610754, now seen corresponding path program 1 times [2024-11-07 06:24:35,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:24:35,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103628750] [2024-11-07 06:24:35,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:35,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:24:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:24:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:24:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 06:24:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:24:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:24:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:24:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:24:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:24:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:24:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:24:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:24:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:24:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:24:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:24:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:24:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:24:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:24:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:24:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:24:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:24:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:24:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:24:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:24:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 18 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-11-07 06:24:36,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:24:36,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103628750] [2024-11-07 06:24:36,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103628750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:24:36,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353853282] [2024-11-07 06:24:36,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:36,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:24:36,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:24:36,690 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:24:36,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 06:24:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:37,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 06:24:37,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:24:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 531 proven. 57 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-07 06:24:37,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:24:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 21 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-07 06:24:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353853282] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:24:37,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:24:37,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 11] total 29 [2024-11-07 06:24:37,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533148353] [2024-11-07 06:24:37,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:24:37,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-07 06:24:37,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:24:37,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-07 06:24:37,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2024-11-07 06:24:37,808 INFO L87 Difference]: Start difference. First operand 1508 states and 2333 transitions. Second operand has 29 states, 29 states have (on average 3.310344827586207) internal successors, (96), 27 states have internal predecessors, (96), 9 states have call successors, (53), 4 states have call predecessors, (53), 8 states have return successors, (55), 10 states have call predecessors, (55), 9 states have call successors, (55) [2024-11-07 06:24:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:24:42,863 INFO L93 Difference]: Finished difference Result 6879 states and 10210 transitions. [2024-11-07 06:24:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2024-11-07 06:24:42,864 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.310344827586207) internal successors, (96), 27 states have internal predecessors, (96), 9 states have call successors, (53), 4 states have call predecessors, (53), 8 states have return successors, (55), 10 states have call predecessors, (55), 9 states have call successors, (55) Word has length 150 [2024-11-07 06:24:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:24:42,910 INFO L225 Difference]: With dead ends: 6879 [2024-11-07 06:24:42,911 INFO L226 Difference]: Without dead ends: 5374 [2024-11-07 06:24:42,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7715 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3793, Invalid=15667, Unknown=0, NotChecked=0, Total=19460 [2024-11-07 06:24:42,929 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1831 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 1027 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1027 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:24:42,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 1261 Invalid, 2725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1027 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 06:24:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5374 states. [2024-11-07 06:24:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5374 to 1415. [2024-11-07 06:24:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 984 states have (on average 1.4227642276422765) internal successors, (1400), 990 states have internal predecessors, (1400), 356 states have call successors, (356), 74 states have call predecessors, (356), 74 states have return successors, (356), 350 states have call predecessors, (356), 356 states have call successors, (356) [2024-11-07 06:24:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2112 transitions. [2024-11-07 06:24:43,368 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2112 transitions. Word has length 150 [2024-11-07 06:24:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:24:43,369 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 2112 transitions. [2024-11-07 06:24:43,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.310344827586207) internal successors, (96), 27 states have internal predecessors, (96), 9 states have call successors, (53), 4 states have call predecessors, (53), 8 states have return successors, (55), 10 states have call predecessors, (55), 9 states have call successors, (55) [2024-11-07 06:24:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2112 transitions. [2024-11-07 06:24:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 06:24:43,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:24:43,372 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:43,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 06:24:43,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:24:43,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:24:43,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:24:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1252123641, now seen corresponding path program 1 times [2024-11-07 06:24:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:24:43,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578937871] [2024-11-07 06:24:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:43,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:24:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:24:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:24:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 06:24:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:24:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:24:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:24:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:24:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:24:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:24:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:24:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:24:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:24:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:24:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:24:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:24:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:24:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:24:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:24:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:24:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:24:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:24:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:24:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:24:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 132 proven. 48 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-11-07 06:24:44,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:24:44,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578937871] [2024-11-07 06:24:44,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578937871] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:24:44,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179870627] [2024-11-07 06:24:44,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:44,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:24:44,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:24:44,213 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:24:44,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 06:24:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:44,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 06:24:44,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:24:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 590 proven. 48 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2024-11-07 06:24:44,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:24:47,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179870627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:24:47,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:24:47,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 14 [2024-11-07 06:24:47,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062892706] [2024-11-07 06:24:47,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:24:47,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 06:24:47,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:24:47,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 06:24:47,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-07 06:24:47,568 INFO L87 Difference]: Start difference. First operand 1415 states and 2112 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) [2024-11-07 06:24:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:24:48,945 INFO L93 Difference]: Finished difference Result 3728 states and 5415 transitions. [2024-11-07 06:24:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 06:24:48,946 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) Word has length 151 [2024-11-07 06:24:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:24:48,962 INFO L225 Difference]: With dead ends: 3728 [2024-11-07 06:24:48,963 INFO L226 Difference]: Without dead ends: 2316 [2024-11-07 06:24:48,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2024-11-07 06:24:48,969 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 157 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 06:24:48,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 893 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 06:24:48,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2024-11-07 06:24:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 911. [2024-11-07 06:24:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 662 states have (on average 1.404833836858006) internal successors, (930), 662 states have internal predecessors, (930), 184 states have call successors, (184), 64 states have call predecessors, (184), 64 states have return successors, (184), 184 states have call predecessors, (184), 184 states have call successors, (184) [2024-11-07 06:24:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1298 transitions. [2024-11-07 06:24:49,192 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1298 transitions. Word has length 151 [2024-11-07 06:24:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:24:49,192 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1298 transitions. [2024-11-07 06:24:49,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) [2024-11-07 06:24:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1298 transitions. [2024-11-07 06:24:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 06:24:49,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:24:49,195 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:49,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 06:24:49,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:24:49,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:24:49,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:24:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2021775301, now seen corresponding path program 1 times [2024-11-07 06:24:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:24:49,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923086602] [2024-11-07 06:24:49,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:49,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:24:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:24:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:24:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 06:24:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:24:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:24:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:24:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:24:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:24:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:24:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:24:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:24:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:24:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:24:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:24:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:24:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:24:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:24:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:24:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:24:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:24:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:24:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:24:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:24:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:24:49,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:24:49,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923086602] [2024-11-07 06:24:49,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923086602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:24:49,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:24:49,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:24:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564233790] [2024-11-07 06:24:49,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:24:49,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:24:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:24:49,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:24:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:24:49,516 INFO L87 Difference]: Start difference. First operand 911 states and 1298 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:24:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:24:49,804 INFO L93 Difference]: Finished difference Result 2257 states and 3302 transitions. [2024-11-07 06:24:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:24:49,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-11-07 06:24:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:24:49,813 INFO L225 Difference]: With dead ends: 2257 [2024-11-07 06:24:49,814 INFO L226 Difference]: Without dead ends: 1349 [2024-11-07 06:24:49,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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:24:49,817 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 76 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:24:49,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 260 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:24:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2024-11-07 06:24:50,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1339. [2024-11-07 06:24:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1026 states have (on average 1.4522417153996101) internal successors, (1490), 1034 states have internal predecessors, (1490), 240 states have call successors, (240), 72 states have call predecessors, (240), 72 states have return successors, (240), 232 states have call predecessors, (240), 240 states have call successors, (240) [2024-11-07 06:24:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1970 transitions. [2024-11-07 06:24:50,067 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1970 transitions. Word has length 151 [2024-11-07 06:24:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:24:50,068 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1970 transitions. [2024-11-07 06:24:50,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:24:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1970 transitions. [2024-11-07 06:24:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 06:24:50,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:24:50,070 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:50,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:24:50,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:24:50,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:24:50,071 INFO L85 PathProgramCache]: Analyzing trace with hash 984386530, now seen corresponding path program 1 times [2024-11-07 06:24:50,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:24:50,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856547802] [2024-11-07 06:24:50,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:50,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:24:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:24:50,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11727234] [2024-11-07 06:24:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:50,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:24:50,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:24:50,175 INFO L229 MonitoredProcess]: Starting monitored process 5 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:24:50,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 06:24:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:24:50,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:24:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:24:50,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:24:50,625 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:24:50,626 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:24:50,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 06:24:50,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-07 06:24:50,831 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 06:24:50,942 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:24:50,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:24:50 BoogieIcfgContainer [2024-11-07 06:24:50,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:24:50,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:24:50,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:24:50,949 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:24:50,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:24:12" (3/4) ... [2024-11-07 06:24:50,952 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:24:50,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:24:50,957 INFO L158 Benchmark]: Toolchain (without parser) took 40093.30ms. Allocated memory was 100.7MB in the beginning and 738.2MB in the end (delta: 637.5MB). Free memory was 76.3MB in the beginning and 631.5MB in the end (delta: -555.2MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. [2024-11-07 06:24:50,957 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:24:50,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.54ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 60.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:24:50,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.49ms. Allocated memory is still 100.7MB. Free memory was 60.7MB in the beginning and 55.5MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:24:50,958 INFO L158 Benchmark]: Boogie Preprocessor took 93.45ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 47.4MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:24:50,958 INFO L158 Benchmark]: RCFGBuilder took 727.51ms. Allocated memory is still 100.7MB. Free memory was 47.4MB in the beginning and 55.0MB in the end (delta: -7.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-07 06:24:50,959 INFO L158 Benchmark]: TraceAbstraction took 38851.94ms. Allocated memory was 100.7MB in the beginning and 738.2MB in the end (delta: 637.5MB). Free memory was 54.1MB in the beginning and 631.5MB in the end (delta: -577.4MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2024-11-07 06:24:50,959 INFO L158 Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 738.2MB. Free memory was 631.5MB in the beginning and 631.5MB in the end (delta: 90.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:24:50,961 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.33ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.54ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 60.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.49ms. Allocated memory is still 100.7MB. Free memory was 60.7MB in the beginning and 55.5MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 93.45ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 47.4MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 727.51ms. Allocated memory is still 100.7MB. Free memory was 47.4MB in the beginning and 55.0MB in the end (delta: -7.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 38851.94ms. Allocated memory was 100.7MB in the beginning and 738.2MB in the end (delta: 637.5MB). Free memory was 54.1MB in the beginning and 631.5MB in the end (delta: -577.4MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. * Witness Printer took 4.84ms. Allocated memory is still 738.2MB. Free memory was 631.5MB in the beginning and 631.5MB in the end (delta: 90.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 53, overapproximation of someUnaryFLOAToperation at line 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 999999999.675; [L23] signed long int var_1_4 = -5; [L24] float var_1_5 = 7.875; [L25] float var_1_6 = 99.04; [L26] signed long int var_1_7 = -2; [L27] unsigned long int var_1_9 = 1; [L28] double var_1_10 = 63.25; [L29] unsigned char var_1_11 = 0; [L30] unsigned short int var_1_13 = 0; [L31] unsigned short int var_1_15 = 17766; [L32] unsigned short int var_1_16 = 28149; [L33] unsigned char var_1_19 = 4; [L34] unsigned char var_1_20 = 50; [L35] unsigned char var_1_21 = 64; [L36] unsigned char var_1_22 = 50; [L37] unsigned char var_1_23 = 5; [L38] unsigned char var_1_24 = 128; [L39] signed long int var_1_25 = -16; [L40] unsigned char var_1_26 = 0; [L41] signed short int var_1_27 = -4; [L42] unsigned short int var_1_33 = 2; [L43] signed long int var_1_36 = -1; [L44] float var_1_38 = 256.7; [L45] unsigned long int var_1_40 = 10; [L46] double var_1_42 = 100.5; [L47] signed char var_1_45 = 8; [L48] unsigned short int last_1_var_1_13 = 0; VAL [isInitial=0, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L175] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L138] var_1_4 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L139] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L140] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L141] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L142] var_1_5 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L143] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L144] var_1_6 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L146] var_1_10 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L147] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L148] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L148] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L149] var_1_11 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L151] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L151] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L152] var_1_15 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_15 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L153] RET assume_abort_if_not(var_1_15 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L154] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L155] var_1_16 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L156] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L157] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L158] var_1_20 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_20 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L159] RET assume_abort_if_not(var_1_20 >= 32) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L161] var_1_21 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_21 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L162] RET assume_abort_if_not(var_1_21 >= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L163] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L164] var_1_22 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L165] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_22 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L166] RET assume_abort_if_not(var_1_22 <= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L167] var_1_23 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L168] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L169] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L170] var_1_24 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_24 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L171] RET assume_abort_if_not(var_1_24 >= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L172] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L52] COND TRUE last_1_var_1_13 == (last_1_var_1_13 % var_1_4) [L53] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L55] COND TRUE \read(var_1_11) [L56] var_1_33 = ((((var_1_26) > (var_1_23)) ? (var_1_26) : (var_1_23))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L58] COND FALSE !(var_1_10 == var_1_1) [L65] var_1_19 = var_1_24 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L67] COND FALSE !(var_1_21 != (var_1_22 + var_1_19)) [L72] var_1_27 = var_1_24 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L74] COND FALSE !(var_1_19 < (var_1_21 / var_1_20)) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L81] COND FALSE !(16 < var_1_22) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L88] COND TRUE var_1_1 >= var_1_6 [L89] var_1_7 = var_1_19 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L91] COND FALSE !(var_1_20 <= var_1_13) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L98] COND FALSE !(((var_1_6 * var_1_5) / var_1_10) > var_1_1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L105] COND FALSE !(var_1_26 < ((((((((var_1_22) > (var_1_26)) ? (var_1_22) : (var_1_26)))) > (var_1_22)) ? (((((var_1_22) > (var_1_26)) ? (var_1_22) : (var_1_26)))) : (var_1_22)))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L108] COND TRUE var_1_6 <= var_1_6 [L109] var_1_42 = (((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) < 0 ) ? -((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) : ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=2, var_1_45=8, var_1_4=-1, var_1_6=0, var_1_7=127, var_1_9=1] [L116] COND FALSE !(var_1_7 < var_1_9) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=2, var_1_45=8, var_1_4=-1, var_1_6=0, var_1_7=127, var_1_9=1] [L119] var_1_38 = var_1_5 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=8, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L120] COND TRUE (var_1_22 % var_1_15) < var_1_20 [L121] var_1_45 = ((var_1_23 - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L125] COND FALSE !((25.3 * var_1_5) != var_1_1) [L134] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=63, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L187] RET step() [L188] CALL, EXPR property() [L178-L179] return (((((((last_1_var_1_13 == (last_1_var_1_13 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((var_1_1 >= var_1_6) ? (var_1_7 == ((signed long int) var_1_19)) : 1)) && ((((var_1_6 * var_1_5) / var_1_10) > var_1_1) ? (var_1_11 ? (var_1_9 == ((unsigned long int) var_1_26)) : (var_1_9 == ((unsigned long int) var_1_26))) : 1)) && ((var_1_7 < var_1_9) ? (var_1_13 == ((unsigned short int) (var_1_26 + (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - (var_1_19 + var_1_19))))) : 1)) && ((var_1_10 == var_1_1) ? (var_1_11 ? (var_1_19 == ((unsigned char) (((32 + var_1_20) + var_1_21) - (var_1_22 + var_1_23)))) : (var_1_19 == ((unsigned char) (var_1_24 - var_1_23)))) : (var_1_19 == ((unsigned char) var_1_24)))) && (((25.3 * var_1_5) != var_1_1) ? (var_1_11 ? ((var_1_15 <= var_1_13) ? (var_1_25 == ((signed long int) var_1_26)) : 1) : (var_1_25 == ((signed long int) var_1_22))) : (var_1_25 == ((signed long int) var_1_20)))) && ((var_1_19 < (var_1_21 / var_1_20)) ? ((var_1_19 > var_1_19) ? (var_1_26 == ((unsigned char) ((((((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) > (var_1_23)) ? (((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) : (var_1_23))))) : (var_1_26 == ((unsigned char) var_1_22))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=63, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=63, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=63, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.7s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6995 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6929 mSDsluCounter, 5432 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4725 mSDsCounter, 3609 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6299 IncrementalHoareTripleChecker+Invalid, 9908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3609 mSolverCounterUnsat, 707 mSDtfsCounter, 6299 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1609 GetRequests, 1090 SyntacticMatches, 1 SemanticMatches, 518 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 63622 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1508occurred in iteration=2, InterpolantAutomatonStates: 491, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 6275 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 1505 NumberOfCodeBlocks, 1505 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1493 ConstructedInterpolants, 0 QuantifiedInterpolants, 5858 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1044 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 9832/10120 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:24:51,161 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-pr-ci_file-8.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:24:53,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:24:53,639 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:24:53,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:24:53,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:24:53,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:24:53,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:24:53,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:24:53,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:24:53,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:24:53,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:24:53,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:24:53,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:24:53,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:24:53,686 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:24:53,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:24:53,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:24:53,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:24:53,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:24:53,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:24:53,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:24:53,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:24:53,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:24:53,687 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:24:53,688 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:24:53,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:24:53,688 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:24:53,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:24:53,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:24:53,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:24:53,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:24:53,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:24:53,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:24:53,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:24:53,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:24:53,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:24:53,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:24:53,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:24:53,689 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:24:53,689 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:24:53,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:24:53,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:24:53,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:24:53,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:24:53,690 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 -> 3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d [2024-11-07 06:24:54,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:24:54,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:24:54,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:24:54,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:24:54,035 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:24:54,036 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-pr-ci_file-8.i [2024-11-07 06:24:55,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:24:55,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:24:55,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-11-07 06:24:55,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72b31b6f5/0664cc16acc440d38e52ad2f3891f9ab/FLAGd3388e49a [2024-11-07 06:24:55,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72b31b6f5/0664cc16acc440d38e52ad2f3891f9ab [2024-11-07 06:24:55,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:24:55,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:24:55,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:24:55,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:24:55,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:24:55,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:24:55" (1/1) ... [2024-11-07 06:24:55,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1545ce9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:55, skipping insertion in model container [2024-11-07 06:24:55,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:24:55" (1/1) ... [2024-11-07 06:24:55,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:24:55,943 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-pr-ci_file-8.i[918,931] [2024-11-07 06:24:56,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:24:56,063 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:24:56,076 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-pr-ci_file-8.i[918,931] [2024-11-07 06:24:56,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:24:56,139 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:24:56,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:56 WrapperNode [2024-11-07 06:24:56,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:24:56,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:24:56,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:24:56,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:24:56,150 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:24:56" (1/1) ... [2024-11-07 06:24:56,163 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:24:56" (1/1) ... [2024-11-07 06:24:56,193 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-07 06:24:56,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:24:56,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:24:56,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:24:56,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:24:56,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:56" (1/1) ... [2024-11-07 06:24:56,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:56" (1/1) ... [2024-11-07 06:24:56,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:56" (1/1) ... [2024-11-07 06:24:56,217 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:24:56,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:56" (1/1) ... [2024-11-07 06:24:56,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:56" (1/1) ... [2024-11-07 06:24:56,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:56" (1/1) ... [2024-11-07 06:24:56,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:56" (1/1) ... [2024-11-07 06:24:56,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:56" (1/1) ... [2024-11-07 06:24:56,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:56" (1/1) ... [2024-11-07 06:24:56,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:24:56,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:24:56,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:24:56,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:24:56,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:56" (1/1) ... [2024-11-07 06:24:56,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:24:56,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:24:56,280 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:24:56,282 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:24:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:24:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:24:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:24:56,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:24:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:24:56,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:24:56,378 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:24:56,380 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:25:18,804 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 06:25:18,805 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:25:18,816 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:25:18,816 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:25:18,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:25:18 BoogieIcfgContainer [2024-11-07 06:25:18,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:25:18,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:25:18,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:25:18,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:25:18,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:24:55" (1/3) ... [2024-11-07 06:25:18,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26203dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:25:18, skipping insertion in model container [2024-11-07 06:25:18,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:56" (2/3) ... [2024-11-07 06:25:18,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26203dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:25:18, skipping insertion in model container [2024-11-07 06:25:18,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:25:18" (3/3) ... [2024-11-07 06:25:18,826 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-11-07 06:25:18,842 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:25:18,842 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:25:18,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:25:18,919 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;@1bb6c1b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:25:18,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:25:18,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 55 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:25:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 06:25:18,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:25:18,940 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:18,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:25:18,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:25:18,947 INFO L85 PathProgramCache]: Analyzing trace with hash -630852230, now seen corresponding path program 1 times [2024-11-07 06:25:18,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:25:18,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100405527] [2024-11-07 06:25:18,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:25:18,962 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:25:18,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:25:18,966 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:25:18,968 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:25:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:25:20,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:25:20,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:25:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2024-11-07 06:25:20,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:25:20,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:25:20,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100405527] [2024-11-07 06:25:20,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100405527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:25:20,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:25:20,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:25:20,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623662213] [2024-11-07 06:25:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:25:20,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:25:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:25:20,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:25:20,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:25:20,338 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 55 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 06:25:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:25:20,366 INFO L93 Difference]: Finished difference Result 153 states and 277 transitions. [2024-11-07 06:25:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:25:20,368 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2024-11-07 06:25:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:25:20,373 INFO L225 Difference]: With dead ends: 153 [2024-11-07 06:25:20,374 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 06:25:20,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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:25:20,379 INFO L432 NwaCegarLoop]: 122 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, 122 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:25:20,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:25:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 06:25:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-07 06:25:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 51 states have internal predecessors, (76), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:25:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 122 transitions. [2024-11-07 06:25:20,422 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 122 transitions. Word has length 150 [2024-11-07 06:25:20,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:25:20,422 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 122 transitions. [2024-11-07 06:25:20,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 06:25:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 122 transitions. [2024-11-07 06:25:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 06:25:20,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:25:20,426 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:20,459 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:25:20,627 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:25:20,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:25:20,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:25:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1124914048, now seen corresponding path program 1 times [2024-11-07 06:25:20,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:25:20,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211412647] [2024-11-07 06:25:20,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:25:20,629 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:25:20,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:25:20,633 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:25:20,635 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:25:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:25:22,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 06:25:22,009 INFO L278 TraceCheckSpWp]: Computing forward predicates...