./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.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', 'e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.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 e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:53:00,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:53:00,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 03:53:00,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:53:00,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:53:00,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:53:00,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:53:00,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:53:00,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:53:00,991 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:53:00,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:53:00,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:53:00,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:53:00,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:53:00,993 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:53:00,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:53:00,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:53:00,993 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:53:00,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:53:00,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:53:00,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:53:00,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:53:00,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:53:00,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:53:00,993 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:53:00,994 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:53:00,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:53:00,994 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:53:00,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:53:00,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:53:00,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:53:00,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:53:00,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:53:00,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:53:00,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:53:00,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:53:00,995 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:53:00,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:53:00,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:53:00,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:53:00,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:53:00,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:53:00,997 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 -> e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d [2024-11-07 03:53:01,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:53:01,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:53:01,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:53:01,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:53:01,267 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:53:01,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i [2024-11-07 03:53:02,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:53:02,811 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:53:02,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i [2024-11-07 03:53:02,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92def6e02/d4d72c24261f4e93b3c9ebb9b46017e6/FLAGf6ebc3b0c [2024-11-07 03:53:03,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92def6e02/d4d72c24261f4e93b3c9ebb9b46017e6 [2024-11-07 03:53:03,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:53:03,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:53:03,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:53:03,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:53:03,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:53:03,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5103e3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03, skipping insertion in model container [2024-11-07 03:53:03,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:53:03,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i[919,932] [2024-11-07 03:53:03,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:53:03,350 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:53:03,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i[919,932] [2024-11-07 03:53:03,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:53:03,396 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:53:03,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03 WrapperNode [2024-11-07 03:53:03,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:53:03,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:53:03,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:53:03,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:53:03,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,460 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-07 03:53:03,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:53:03,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:53:03,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:53:03,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:53:03,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,498 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 03:53:03,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:53:03,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:53:03,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:53:03,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:53:03,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (1/1) ... [2024-11-07 03:53:03,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:53:03,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:53:03,563 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 03:53:03,569 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 03:53:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:53:03,587 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:53:03,587 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:53:03,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:53:03,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:53:03,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:53:03,673 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:53:03,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:53:04,070 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 03:53:04,070 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:53:04,081 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:53:04,081 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:53:04,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:53:04 BoogieIcfgContainer [2024-11-07 03:53:04,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:53:04,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:53:04,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:53:04,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:53:04,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:53:03" (1/3) ... [2024-11-07 03:53:04,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71328e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:53:04, skipping insertion in model container [2024-11-07 03:53:04,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:03" (2/3) ... [2024-11-07 03:53:04,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71328e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:53:04, skipping insertion in model container [2024-11-07 03:53:04,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:53:04" (3/3) ... [2024-11-07 03:53:04,091 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-13.i [2024-11-07 03:53:04,105 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:53:04,106 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:53:04,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:53:04,184 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;@56fb7a07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:53:04,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:53:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 03:53:04,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 03:53:04,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:04,206 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:04,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:04,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1178429317, now seen corresponding path program 1 times [2024-11-07 03:53:04,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:53:04,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168278290] [2024-11-07 03:53:04,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:04,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:53:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:53:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:53:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:53:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:53:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:53:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:53:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:53:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:53:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:53:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:53:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:53:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:53:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:53:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:53:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:53:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:53:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:53:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 03:53:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 03:53:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 03:53:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 03:53:04,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:53:04,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168278290] [2024-11-07 03:53:04,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168278290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:53:04,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:53:04,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:53:04,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240669993] [2024-11-07 03:53:04,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:04,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:53:04,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:53:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:53:04,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:53:04,648 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 03:53:04,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:04,674 INFO L93 Difference]: Finished difference Result 127 states and 216 transitions. [2024-11-07 03:53:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:53:04,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2024-11-07 03:53:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:04,681 INFO L225 Difference]: With dead ends: 127 [2024-11-07 03:53:04,681 INFO L226 Difference]: Without dead ends: 63 [2024-11-07 03:53:04,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 03:53:04,686 INFO L432 NwaCegarLoop]: 93 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, 93 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 03:53:04,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:53:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-07 03:53:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-07 03:53:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 03:53:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2024-11-07 03:53:04,725 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 132 [2024-11-07 03:53:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:04,727 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2024-11-07 03:53:04,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 03:53:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2024-11-07 03:53:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 03:53:04,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:04,734 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:04,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:53:04,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:04,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:04,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1399328131, now seen corresponding path program 1 times [2024-11-07 03:53:04,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:53:04,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068498968] [2024-11-07 03:53:04,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:04,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:53:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:53:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:53:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:53:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:53:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:53:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:53:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:53:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:53:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:53:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:53:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:53:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:53:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:53:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:53:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:53:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:53:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:53:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 03:53:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 03:53:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 03:53:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 03:53:05,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:53:05,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068498968] [2024-11-07 03:53:05,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068498968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:53:05,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:53:05,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:53:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647536152] [2024-11-07 03:53:05,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:05,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 03:53:05,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:53:05,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 03:53:05,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 03:53:05,115 INFO L87 Difference]: Start difference. First operand 63 states and 93 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:05,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:05,169 INFO L93 Difference]: Finished difference Result 155 states and 227 transitions. [2024-11-07 03:53:05,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:53:05,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-07 03:53:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:05,172 INFO L225 Difference]: With dead ends: 155 [2024-11-07 03:53:05,172 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 03:53:05,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 03:53:05,173 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 38 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:05,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 208 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:53:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 03:53:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-07 03:53:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 64 states have internal predecessors, (82), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 03:53:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-07 03:53:05,191 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 132 [2024-11-07 03:53:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:05,192 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-07 03:53:05,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-07 03:53:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 03:53:05,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:05,196 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:05,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:53:05,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:05,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash 812522117, now seen corresponding path program 1 times [2024-11-07 03:53:05,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:53:05,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011486805] [2024-11-07 03:53:05,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:05,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:53:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:53:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:53:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:53:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:53:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:53:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:53:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:53:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:53:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:53:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:53:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:53:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:53:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:53:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:53:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:53:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:53:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:53:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 03:53:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 03:53:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 03:53:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 03:53:06,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:53:06,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011486805] [2024-11-07 03:53:06,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011486805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:53:06,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:53:06,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:53:06,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578254032] [2024-11-07 03:53:06,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:06,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:53:06,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:53:06,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:53:06,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:53:06,049 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:06,424 INFO L93 Difference]: Finished difference Result 259 states and 381 transitions. [2024-11-07 03:53:06,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:53:06,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-07 03:53:06,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:06,430 INFO L225 Difference]: With dead ends: 259 [2024-11-07 03:53:06,431 INFO L226 Difference]: Without dead ends: 170 [2024-11-07 03:53:06,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:53:06,435 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 68 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:06,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 280 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:53:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-07 03:53:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 132. [2024-11-07 03:53:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 03:53:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2024-11-07 03:53:06,480 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 132 [2024-11-07 03:53:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:06,481 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2024-11-07 03:53:06,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2024-11-07 03:53:06,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 03:53:06,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:06,482 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:06,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:53:06,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:06,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:06,485 INFO L85 PathProgramCache]: Analyzing trace with hash -944418578, now seen corresponding path program 1 times [2024-11-07 03:53:06,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:53:06,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877242501] [2024-11-07 03:53:06,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:06,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:53:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:53:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:53:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:53:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:53:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:53:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:53:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:53:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:53:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:53:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:53:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:53:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:53:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:53:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:53:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:53:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:53:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:53:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 03:53:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 03:53:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 03:53:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 03:53:06,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:53:06,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877242501] [2024-11-07 03:53:06,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877242501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:53:06,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:53:06,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:53:06,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518275576] [2024-11-07 03:53:06,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:06,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:53:06,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:53:06,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:53:06,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:53:06,792 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:06,981 INFO L93 Difference]: Finished difference Result 258 states and 377 transitions. [2024-11-07 03:53:06,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:53:06,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-07 03:53:06,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:06,984 INFO L225 Difference]: With dead ends: 258 [2024-11-07 03:53:06,985 INFO L226 Difference]: Without dead ends: 169 [2024-11-07 03:53:06,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:53:06,987 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 110 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:06,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 112 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:53:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-07 03:53:07,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2024-11-07 03:53:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 86 states have internal predecessors, (106), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 03:53:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-07 03:53:07,028 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 133 [2024-11-07 03:53:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:07,029 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-07 03:53:07,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-07 03:53:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 03:53:07,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:07,034 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:07,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:53:07,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:07,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash -686253140, now seen corresponding path program 1 times [2024-11-07 03:53:07,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:53:07,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975238521] [2024-11-07 03:53:07,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:07,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:53:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 03:53:07,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219860405] [2024-11-07 03:53:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:07,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:53:07,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:53:07,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 03:53:07,165 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 03:53:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:53:07,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:53:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:53:07,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:53:07,441 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:53:07,442 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:53:07,463 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 03:53:07,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:53:07,648 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 03:53:07,742 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:53:07,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:53:07 BoogieIcfgContainer [2024-11-07 03:53:07,744 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:53:07,745 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:53:07,745 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:53:07,745 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:53:07,746 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:53:04" (3/4) ... [2024-11-07 03:53:07,748 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:53:07,749 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:53:07,749 INFO L158 Benchmark]: Toolchain (without parser) took 4594.33ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.3MB in the beginning and 58.7MB in the end (delta: 17.6MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-11-07 03:53:07,750 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:53:07,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.45ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 62.2MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:53:07,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.09ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 59.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:53:07,750 INFO L158 Benchmark]: Boogie Preprocessor took 64.83ms. Allocated memory is still 100.7MB. Free memory was 59.0MB in the beginning and 54.4MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:53:07,754 INFO L158 Benchmark]: RCFGBuilder took 552.11ms. Allocated memory is still 100.7MB. Free memory was 54.4MB in the beginning and 72.3MB in the end (delta: -18.0MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2024-11-07 03:53:07,754 INFO L158 Benchmark]: TraceAbstraction took 3661.08ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 71.9MB in the beginning and 60.0MB in the end (delta: 11.9MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2024-11-07 03:53:07,754 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 125.8MB. Free memory was 60.0MB in the beginning and 58.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:53:07,755 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.89ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.45ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 62.2MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.09ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 59.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.83ms. Allocated memory is still 100.7MB. Free memory was 59.0MB in the beginning and 54.4MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 552.11ms. Allocated memory is still 100.7MB. Free memory was 54.4MB in the beginning and 72.3MB in the end (delta: -18.0MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3661.08ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 71.9MB in the beginning and 60.0MB in the end (delta: 11.9MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 125.8MB. Free memory was 60.0MB in the beginning and 58.7MB in the end (delta: 1.3MB). 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 someBinaryDOUBLEComparisonOperation at line 123. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] signed short int last_1_var_1_21 = -64; [L43] unsigned char last_1_var_1_22 = 25; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L119] last_1_var_1_21 = var_1_21 [L120] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L88] var_1_5 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L89] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L91] var_1_6 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L94] var_1_9 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L95] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L96] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L97] var_1_10 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L99] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L100] var_1_11 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L101] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L102] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L103] var_1_13 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L104] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L105] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L106] var_1_14 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L107] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L108] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L109] var_1_17 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L110] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L111] var_1_18 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L112] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L113] var_1_19 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L115] var_1_20 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L131] RET updateVariables() [L132] CALL step() [L47] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L47] COND TRUE (~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4) [L48] COND TRUE var_1_5 || var_1_6 [L49] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L56] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L59] COND FALSE !(var_1_4 > var_1_1) [L62] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L64] COND TRUE ((- var_1_11) < 8) || var_1_9 [L65] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L67] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L68] COND TRUE var_1_18 <= var_1_20 [L69] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L75] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L80] COND TRUE var_1_10 > var_1_21 [L81] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L123-L124] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-449, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 693 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 317 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 376 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 75 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 795 NumberOfCodeBlocks, 795 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 525 ConstructedInterpolants, 0 QuantifiedInterpolants, 1567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3040/3040 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 03:53:07,777 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_codestructure_dependencies_file-13.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 e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:53:09,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:53:10,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 03:53:10,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:53:10,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:53:10,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:53:10,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:53:10,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:53:10,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:53:10,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:53:10,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:53:10,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:53:10,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:53:10,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:53:10,073 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:53:10,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:53:10,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:53:10,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:53:10,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:53:10,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:53:10,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:53:10,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:53:10,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:53:10,075 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:53:10,075 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:53:10,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:53:10,075 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:53:10,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:53:10,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:53:10,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:53:10,075 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:53:10,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:53:10,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:53:10,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:53:10,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:53:10,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:53:10,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:53:10,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:53:10,077 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:53:10,077 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:53:10,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:53:10,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:53:10,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:53:10,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:53:10,078 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 -> e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d [2024-11-07 03:53:10,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:53:10,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:53:10,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:53:10,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:53:10,366 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:53:10,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i [2024-11-07 03:53:11,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:53:11,946 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:53:11,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i [2024-11-07 03:53:11,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a2e24460/88f24804887e481c89a8062e3f9d5589/FLAG96fad2fc8 [2024-11-07 03:53:11,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a2e24460/88f24804887e481c89a8062e3f9d5589 [2024-11-07 03:53:11,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:53:11,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:53:11,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:53:11,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:53:11,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:53:11,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7948f550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11, skipping insertion in model container [2024-11-07 03:53:11,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:12,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:53:12,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i[919,932] [2024-11-07 03:53:12,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:53:12,239 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:53:12,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i[919,932] [2024-11-07 03:53:12,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:53:12,300 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:53:12,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12 WrapperNode [2024-11-07 03:53:12,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:53:12,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:53:12,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:53:12,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:53:12,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (1/1) ... [2024-11-07 03:53:12,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (1/1) ... [2024-11-07 03:53:12,347 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-11-07 03:53:12,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:53:12,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:53:12,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:53:12,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:53:12,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (1/1) ... [2024-11-07 03:53:12,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (1/1) ... [2024-11-07 03:53:12,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (1/1) ... [2024-11-07 03:53:12,373 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 03:53:12,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (1/1) ... [2024-11-07 03:53:12,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (1/1) ... [2024-11-07 03:53:12,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (1/1) ... [2024-11-07 03:53:12,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (1/1) ... [2024-11-07 03:53:12,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (1/1) ... [2024-11-07 03:53:12,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (1/1) ... [2024-11-07 03:53:12,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:53:12,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:53:12,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:53:12,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:53:12,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (1/1) ... [2024-11-07 03:53:12,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:53:12,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:53:12,429 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 03:53:12,433 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 03:53:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:53:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:53:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:53:12,454 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:53:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:53:12,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:53:12,528 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:53:12,530 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:53:16,329 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 03:53:16,329 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:53:16,343 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:53:16,343 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:53:16,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:53:16 BoogieIcfgContainer [2024-11-07 03:53:16,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:53:16,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:53:16,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:53:16,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:53:16,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:53:11" (1/3) ... [2024-11-07 03:53:16,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1f4560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:53:16, skipping insertion in model container [2024-11-07 03:53:16,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:12" (2/3) ... [2024-11-07 03:53:16,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1f4560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:53:16, skipping insertion in model container [2024-11-07 03:53:16,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:53:16" (3/3) ... [2024-11-07 03:53:16,355 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-13.i [2024-11-07 03:53:16,379 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:53:16,380 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:53:16,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:53:16,438 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;@61a33296, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:53:16,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:53:16,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 03:53:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 03:53:16,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:16,457 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:16,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:16,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash 492248995, now seen corresponding path program 1 times [2024-11-07 03:53:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:53:16,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616959334] [2024-11-07 03:53:16,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:16,472 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 03:53:16,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:53:16,475 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 03:53:16,477 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 03:53:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:16,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 03:53:16,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:53:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-07 03:53:16,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:53:16,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:53:16,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616959334] [2024-11-07 03:53:16,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616959334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:53:16,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:53:16,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:53:16,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502874608] [2024-11-07 03:53:16,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:16,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:53:16,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:53:16,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:53:16,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:53:16,958 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 03:53:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:16,984 INFO L93 Difference]: Finished difference Result 117 states and 202 transitions. [2024-11-07 03:53:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:53:16,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-07 03:53:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:16,991 INFO L225 Difference]: With dead ends: 117 [2024-11-07 03:53:16,991 INFO L226 Difference]: Without dead ends: 58 [2024-11-07 03:53:16,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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 03:53:16,996 INFO L432 NwaCegarLoop]: 86 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, 86 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 03:53:16,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:53:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-07 03:53:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-07 03:53:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 03:53:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-11-07 03:53:17,041 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 129 [2024-11-07 03:53:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:17,042 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-11-07 03:53:17,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 03:53:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-11-07 03:53:17,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 03:53:17,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:17,049 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:17,061 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 03:53:17,249 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 03:53:17,250 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:17,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash 302319515, now seen corresponding path program 1 times [2024-11-07 03:53:17,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:53:17,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842118053] [2024-11-07 03:53:17,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:17,252 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 03:53:17,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:53:17,254 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 03:53:17,256 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 03:53:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:17,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 03:53:17,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:53:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 03:53:19,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:53:19,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:53:19,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842118053] [2024-11-07 03:53:19,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842118053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:53:19,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:53:19,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:53:19,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727216910] [2024-11-07 03:53:19,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:19,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:53:19,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:53:19,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:53:19,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:53:19,506 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:21,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:53:24,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:53:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:24,207 INFO L93 Difference]: Finished difference Result 169 states and 253 transitions. [2024-11-07 03:53:24,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:53:24,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-07 03:53:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:24,235 INFO L225 Difference]: With dead ends: 169 [2024-11-07 03:53:24,235 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 03:53:24,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:53:24,236 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 51 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:24,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 236 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-07 03:53:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 03:53:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2024-11-07 03:53:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 03:53:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-11-07 03:53:24,265 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 129 [2024-11-07 03:53:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:24,266 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-11-07 03:53:24,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-11-07 03:53:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 03:53:24,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:24,268 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:24,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 03:53:24,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:53:24,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:24,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash -608317909, now seen corresponding path program 1 times [2024-11-07 03:53:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:53:24,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690104625] [2024-11-07 03:53:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:24,470 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 03:53:24,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:53:24,472 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:53:24,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 03:53:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:24,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 03:53:24,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:53:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 03:53:26,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:53:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 03:53:26,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:53:26,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690104625] [2024-11-07 03:53:26,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690104625] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 03:53:26,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 03:53:26,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-07 03:53:26,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951651431] [2024-11-07 03:53:26,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:26,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 03:53:26,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:53:26,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 03:53:26,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:53:26,717 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:29,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:53:32,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:53:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:32,720 INFO L93 Difference]: Finished difference Result 169 states and 251 transitions. [2024-11-07 03:53:32,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:53:32,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-07 03:53:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:32,722 INFO L225 Difference]: With dead ends: 169 [2024-11-07 03:53:32,722 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 03:53:32,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:53:32,723 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 23 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:32,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 147 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-07 03:53:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 03:53:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2024-11-07 03:53:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 03:53:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 147 transitions. [2024-11-07 03:53:32,748 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 147 transitions. Word has length 130 [2024-11-07 03:53:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:32,749 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 147 transitions. [2024-11-07 03:53:32,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 147 transitions. [2024-11-07 03:53:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 03:53:32,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:32,750 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:32,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 03:53:32,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:53:32,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:32,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:32,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1001344919, now seen corresponding path program 1 times [2024-11-07 03:53:32,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:53:32,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813032557] [2024-11-07 03:53:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:32,952 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 03:53:32,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:53:32,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:53:32,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 03:53:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:33,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 03:53:33,252 INFO L278 TraceCheckSpWp]: Computing forward predicates...