./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-52.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_operatoramount_amount25_file-52.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', '2b49dec271465b2754e36573ebd59f8c437d77cb6b6af58205c53363f2448e6a'] 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_operatoramount_amount25_file-52.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 2b49dec271465b2754e36573ebd59f8c437d77cb6b6af58205c53363f2448e6a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:31:39,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:31:39,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:31:39,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:31:39,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:31:39,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:31:39,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:31:39,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:31:39,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:31:39,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:31:39,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:31:39,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:31:39,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:31:39,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:31:39,791 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:31:39,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:31:39,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:31:39,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:31:39,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:31:39,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:31:39,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:31:39,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:31:39,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:31:39,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:31:39,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:31:39,793 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:31:39,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:31:39,793 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:31:39,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:31:39,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:31:39,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:31:39,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:31:39,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:31:39,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:31:39,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:31:39,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:31:39,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:31:39,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:31:39,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:31:39,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:31:39,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:31:39,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:31:39,796 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 -> 2b49dec271465b2754e36573ebd59f8c437d77cb6b6af58205c53363f2448e6a [2024-11-07 09:31:40,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:31:40,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:31:40,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:31:40,123 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:31:40,123 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:31:40,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-52.i [2024-11-07 09:31:41,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:31:41,716 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:31:41,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-52.i [2024-11-07 09:31:41,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9aff65066/97f529eec21849d5b4a27831c44d2ff6/FLAG5564951c1 [2024-11-07 09:31:42,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9aff65066/97f529eec21849d5b4a27831c44d2ff6 [2024-11-07 09:31:42,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:31:42,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:31:42,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:31:42,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:31:42,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:31:42,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65cdca67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42, skipping insertion in model container [2024-11-07 09:31:42,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:31:42,194 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_operatoramount_amount25_file-52.i[915,928] [2024-11-07 09:31:42,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:31:42,272 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:31:42,285 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_operatoramount_amount25_file-52.i[915,928] [2024-11-07 09:31:42,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:31:42,335 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:31:42,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42 WrapperNode [2024-11-07 09:31:42,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:31:42,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:31:42,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:31:42,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:31:42,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,394 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-07 09:31:42,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:31:42,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:31:42,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:31:42,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:31:42,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,439 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 09:31:42,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:31:42,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:31:42,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:31:42,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:31:42,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (1/1) ... [2024-11-07 09:31:42,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:31:42,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:31:42,518 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 09:31:42,522 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 09:31:42,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:31:42,546 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:31:42,547 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:31:42,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:31:42,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:31:42,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:31:42,610 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:31:42,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:31:42,904 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 09:31:42,904 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:31:42,917 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:31:42,918 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:31:42,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:31:42 BoogieIcfgContainer [2024-11-07 09:31:42,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:31:42,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:31:42,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:31:42,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:31:42,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:31:42" (1/3) ... [2024-11-07 09:31:42,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e062bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:31:42, skipping insertion in model container [2024-11-07 09:31:42,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:42" (2/3) ... [2024-11-07 09:31:42,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e062bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:31:42, skipping insertion in model container [2024-11-07 09:31:42,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:31:42" (3/3) ... [2024-11-07 09:31:42,930 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-52.i [2024-11-07 09:31:42,943 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:31:42,944 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:31:43,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:31:43,018 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;@3924e461, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:31:43,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:31:43,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 09:31:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 09:31:43,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:43,037 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:43,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:43,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:43,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1915705130, now seen corresponding path program 1 times [2024-11-07 09:31:43,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:31:43,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107675258] [2024-11-07 09:31:43,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:31:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:31:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:31:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:31:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:31:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:31:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 09:31:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:31:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 09:31:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:31:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 09:31:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:31:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 09:31:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 09:31:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 09:31:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 09:31:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 09:31:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 09:31:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 09:31:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 09:31:44,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:31:44,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107675258] [2024-11-07 09:31:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107675258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 09:31:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923466] [2024-11-07 09:31:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:44,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:31:44,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:31:44,574 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 09:31:44,576 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 09:31:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:44,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 09:31:44,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:31:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 326 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-07 09:31:45,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:31:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 09:31:45,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 09:31:45,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 09:31:45,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 17 [2024-11-07 09:31:45,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173410971] [2024-11-07 09:31:45,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 09:31:45,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 09:31:45,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:31:45,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 09:31:45,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-07 09:31:45,654 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2024-11-07 09:31:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:31:46,877 INFO L93 Difference]: Finished difference Result 213 states and 366 transitions. [2024-11-07 09:31:46,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-07 09:31:46,880 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 113 [2024-11-07 09:31:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:31:46,890 INFO L225 Difference]: With dead ends: 213 [2024-11-07 09:31:46,890 INFO L226 Difference]: Without dead ends: 164 [2024-11-07 09:31:46,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=464, Invalid=1342, Unknown=0, NotChecked=0, Total=1806 [2024-11-07 09:31:46,896 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 152 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 09:31:46,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 339 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 09:31:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-07 09:31:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 109. [2024-11-07 09:31:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 65 states have (on average 1.123076923076923) internal successors, (73), 66 states have internal predecessors, (73), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 09:31:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 145 transitions. [2024-11-07 09:31:46,976 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 145 transitions. Word has length 113 [2024-11-07 09:31:46,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:31:46,977 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 145 transitions. [2024-11-07 09:31:46,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2024-11-07 09:31:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 145 transitions. [2024-11-07 09:31:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 09:31:46,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:46,982 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:47,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 09:31:47,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-07 09:31:47,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:47,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1106358504, now seen corresponding path program 1 times [2024-11-07 09:31:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:31:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040341642] [2024-11-07 09:31:47,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:31:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:31:47,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 09:31:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:31:47,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 09:31:47,398 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 09:31:47,399 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:31:47,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:31:47,404 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-07 09:31:47,485 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:31:47,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:31:47 BoogieIcfgContainer [2024-11-07 09:31:47,490 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:31:47,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:31:47,491 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:31:47,491 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:31:47,493 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:31:42" (3/4) ... [2024-11-07 09:31:47,496 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 09:31:47,497 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:31:47,497 INFO L158 Benchmark]: Toolchain (without parser) took 5465.15ms. Allocated memory is still 109.1MB. Free memory was 84.8MB in the beginning and 67.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-07 09:31:47,498 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 46.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:31:47,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.91ms. Allocated memory is still 109.1MB. Free memory was 84.6MB in the beginning and 71.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:31:47,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.12ms. Allocated memory is still 109.1MB. Free memory was 71.8MB in the beginning and 69.0MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:31:47,500 INFO L158 Benchmark]: Boogie Preprocessor took 76.25ms. Allocated memory is still 109.1MB. Free memory was 69.0MB in the beginning and 64.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:31:47,500 INFO L158 Benchmark]: RCFGBuilder took 443.65ms. Allocated memory is still 109.1MB. Free memory was 64.9MB in the beginning and 48.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 09:31:47,501 INFO L158 Benchmark]: TraceAbstraction took 4568.81ms. Allocated memory is still 109.1MB. Free memory was 47.8MB in the beginning and 67.1MB in the end (delta: -19.2MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-11-07 09:31:47,501 INFO L158 Benchmark]: Witness Printer took 5.80ms. Allocated memory is still 109.1MB. Free memory was 67.1MB in the beginning and 67.0MB in the end (delta: 22.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:31:47,504 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 46.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.91ms. Allocated memory is still 109.1MB. Free memory was 84.6MB in the beginning and 71.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.12ms. Allocated memory is still 109.1MB. Free memory was 71.8MB in the beginning and 69.0MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.25ms. Allocated memory is still 109.1MB. Free memory was 69.0MB in the beginning and 64.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 443.65ms. Allocated memory is still 109.1MB. Free memory was 64.9MB in the beginning and 48.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4568.81ms. Allocated memory is still 109.1MB. Free memory was 47.8MB in the beginning and 67.1MB in the end (delta: -19.2MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 5.80ms. Allocated memory is still 109.1MB. Free memory was 67.1MB in the beginning and 67.0MB in the end (delta: 22.6kB). 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 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] double var_1_2 = 255.6; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 8; [L29] double var_1_10 = 255.2; [L30] unsigned char var_1_11 = 64; [L31] unsigned char var_1_12 = 100; [L32] unsigned char var_1_13 = 32; [L33] unsigned char var_1_14 = 64; [L34] unsigned char var_1_15 = 0; VAL [isInitial=0, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_2=1278/5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L62] var_1_6 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L63] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L64] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L64] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L65] var_1_7 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L66] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L67] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L67] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L68] var_1_8 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_9=8] [L69] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_9=8] [L70] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L70] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L71] var_1_10 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L72] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L74] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L75] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L75] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 64) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L77] RET assume_abort_if_not(var_1_12 >= 64) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L78] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L78] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L81] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L81] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L82] var_1_14 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L84] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L84] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L86] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L87] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L87] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L100] RET updateVariables() [L101] CALL step() [L38] COND TRUE (- var_1_2) <= var_1_10 [L39] var_1_9 = ((((((var_1_11 + var_1_12) - var_1_13)) < ((var_1_14 + var_1_15))) ? (((var_1_11 + var_1_12) - var_1_13)) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L43] COND TRUE var_1_2 < 63.75 [L44] var_1_1 = (10 - var_1_9) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L48] signed long int stepLocal_0 = (var_1_9 / -256) * 32; VAL [isInitial=1, stepLocal_0=0, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L49] COND FALSE !(var_1_9 > stepLocal_0) [L56] var_1_5 = var_1_7 VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=-255, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L101] RET step() [L102] CALL, EXPR property() [L92-L93] return (((var_1_2 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_9))) : (var_1_1 == ((signed short int) (4 + var_1_9)))) && ((var_1_9 > ((var_1_9 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && (! var_1_8))))) : (var_1_5 == ((unsigned char) var_1_7))) : (var_1_5 == ((unsigned char) var_1_7)))) && (((- var_1_2) <= var_1_10) ? (var_1_9 == ((unsigned char) ((((((var_1_11 + var_1_12) - var_1_13)) < ((var_1_14 + var_1_15))) ? (((var_1_11 + var_1_12) - var_1_13)) : ((var_1_14 + var_1_15)))))) : (var_1_9 == ((unsigned char) var_1_12))) ; VAL [\result=0, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=-255, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=-255, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=-255, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 339 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 259 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 551 IncrementalHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 80 mSDtfsCounter, 551 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=1, InterpolantAutomatonStates: 36, 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, 1 MinimizatonAttempts, 55 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 1104 SizeOfPredicates, 3 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 3 InterpolantComputations, 0 PerfectInterpolantSequences, 1758/1836 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 09:31:47,536 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_operatoramount_amount25_file-52.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 2b49dec271465b2754e36573ebd59f8c437d77cb6b6af58205c53363f2448e6a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:31:49,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:31:49,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 09:31:49,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:31:49,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:31:50,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:31:50,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:31:50,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:31:50,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:31:50,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:31:50,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:31:50,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:31:50,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:31:50,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:31:50,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:31:50,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:31:50,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:31:50,021 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:31:50,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:31:50,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:31:50,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:31:50,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:31:50,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:31:50,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:31:50,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:31:50,023 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 09:31:50,023 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 09:31:50,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:31:50,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:31:50,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:31:50,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:31:50,023 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 -> 2b49dec271465b2754e36573ebd59f8c437d77cb6b6af58205c53363f2448e6a [2024-11-07 09:31:50,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:31:50,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:31:50,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:31:50,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:31:50,353 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:31:50,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-52.i [2024-11-07 09:31:51,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:31:52,232 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:31:52,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-52.i [2024-11-07 09:31:52,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6296174b9/2d5048f01b7d4bf685a9cf143c66c1c6/FLAG605c57fd1 [2024-11-07 09:31:52,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6296174b9/2d5048f01b7d4bf685a9cf143c66c1c6 [2024-11-07 09:31:52,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:31:52,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:31:52,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:31:52,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:31:52,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:31:52,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13faf03c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52, skipping insertion in model container [2024-11-07 09:31:52,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:31:52,460 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_operatoramount_amount25_file-52.i[915,928] [2024-11-07 09:31:52,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:31:52,542 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:31:52,554 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_operatoramount_amount25_file-52.i[915,928] [2024-11-07 09:31:52,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:31:52,610 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:31:52,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52 WrapperNode [2024-11-07 09:31:52,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:31:52,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:31:52,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:31:52,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:31:52,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,652 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-07 09:31:52,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:31:52,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:31:52,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:31:52,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:31:52,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,676 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 09:31:52,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:31:52,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:31:52,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:31:52,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:31:52,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (1/1) ... [2024-11-07 09:31:52,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:31:52,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:31:52,741 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 09:31:52,744 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 09:31:52,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:31:52,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 09:31:52,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:31:52,768 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:31:52,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:31:52,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:31:52,849 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:31:52,851 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:31:53,052 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 09:31:53,053 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:31:53,065 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:31:53,066 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:31:53,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:31:53 BoogieIcfgContainer [2024-11-07 09:31:53,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:31:53,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:31:53,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:31:53,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:31:53,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:31:52" (1/3) ... [2024-11-07 09:31:53,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c65bf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:31:53, skipping insertion in model container [2024-11-07 09:31:53,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:52" (2/3) ... [2024-11-07 09:31:53,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c65bf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:31:53, skipping insertion in model container [2024-11-07 09:31:53,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:31:53" (3/3) ... [2024-11-07 09:31:53,080 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-52.i [2024-11-07 09:31:53,099 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:31:53,099 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:31:53,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:31:53,166 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;@22944de4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:31:53,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:31:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 09:31:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 09:31:53,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:53,187 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:53,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:53,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1915705130, now seen corresponding path program 1 times [2024-11-07 09:31:53,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:31:53,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83761447] [2024-11-07 09:31:53,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:53,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:31:53,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:31:53,224 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 09:31:53,226 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 09:31:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:53,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 09:31:53,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:31:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 326 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-07 09:31:53,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:31:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 09:31:54,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:31:54,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83761447] [2024-11-07 09:31:54,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83761447] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 09:31:54,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 09:31:54,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-11-07 09:31:54,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340257725] [2024-11-07 09:31:54,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 09:31:54,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 09:31:54,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:31:54,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 09:31:54,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-07 09:31:54,399 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-07 09:31:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:31:55,655 INFO L93 Difference]: Finished difference Result 207 states and 359 transitions. [2024-11-07 09:31:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 09:31:55,657 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 113 [2024-11-07 09:31:55,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:31:55,665 INFO L225 Difference]: With dead ends: 207 [2024-11-07 09:31:55,665 INFO L226 Difference]: Without dead ends: 158 [2024-11-07 09:31:55,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 09:31:55,674 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 220 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 09:31:55,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 267 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 09:31:55,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-07 09:31:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 59. [2024-11-07 09:31:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 09:31:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2024-11-07 09:31:55,733 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 113 [2024-11-07 09:31:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:31:55,734 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2024-11-07 09:31:55,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-07 09:31:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-11-07 09:31:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 09:31:55,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:55,737 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:55,746 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-07 09:31:55,941 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 09:31:55,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:55,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:55,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1106358504, now seen corresponding path program 1 times [2024-11-07 09:31:55,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:31:55,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180678366] [2024-11-07 09:31:55,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:55,944 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 09:31:55,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:31:55,946 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 09:31:55,947 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 09:31:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:56,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 09:31:56,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:32:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 09:32:05,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:32:05,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:32:05,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180678366] [2024-11-07 09:32:05,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180678366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:05,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:05,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 09:32:05,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901034636] [2024-11-07 09:32:05,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:05,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 09:32:05,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:32:05,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 09:32:05,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:32:05,118 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 09:32:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:05,609 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2024-11-07 09:32:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 09:32:05,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-07 09:32:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:05,612 INFO L225 Difference]: With dead ends: 87 [2024-11-07 09:32:05,612 INFO L226 Difference]: Without dead ends: 85 [2024-11-07 09:32:05,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:32:05,614 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 36 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:05,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 277 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 09:32:05,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-07 09:32:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2024-11-07 09:32:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 09:32:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2024-11-07 09:32:05,629 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 113 [2024-11-07 09:32:05,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:05,630 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2024-11-07 09:32:05,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 09:32:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2024-11-07 09:32:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 09:32:05,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:05,633 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:05,641 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-07 09:32:05,834 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 09:32:05,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:05,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:05,835 INFO L85 PathProgramCache]: Analyzing trace with hash 668648858, now seen corresponding path program 1 times [2024-11-07 09:32:05,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:32:05,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067735201] [2024-11-07 09:32:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:05,836 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 09:32:05,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:32:05,838 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 09:32:05,839 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 09:32:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:05,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 09:32:05,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:32:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 09:32:12,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:32:12,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:32:12,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067735201] [2024-11-07 09:32:12,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067735201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:12,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:12,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 09:32:12,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865091883] [2024-11-07 09:32:12,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:12,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 09:32:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:32:12,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 09:32:12,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:32:12,520 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 09:32:13,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:13,039 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2024-11-07 09:32:13,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 09:32:13,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-07 09:32:13,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:13,045 INFO L225 Difference]: With dead ends: 90 [2024-11-07 09:32:13,045 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 09:32:13,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:32:13,046 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 33 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:13,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 331 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 09:32:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 09:32:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2024-11-07 09:32:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 09:32:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2024-11-07 09:32:13,061 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 113 [2024-11-07 09:32:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:13,061 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2024-11-07 09:32:13,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 09:32:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2024-11-07 09:32:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 09:32:13,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:13,063 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:13,070 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 09:32:13,264 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 09:32:13,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:13,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:13,266 INFO L85 PathProgramCache]: Analyzing trace with hash 508969851, now seen corresponding path program 1 times [2024-11-07 09:32:13,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:32:13,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73716018] [2024-11-07 09:32:13,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:13,266 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 09:32:13,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:32:13,269 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 09:32:13,272 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 09:32:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:13,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 09:32:13,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:32:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 326 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-07 09:32:19,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:32:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 09:32:40,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:32:40,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73716018] [2024-11-07 09:32:40,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73716018] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 09:32:40,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 09:32:40,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2024-11-07 09:32:40,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967783497] [2024-11-07 09:32:40,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:40,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:32:40,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:32:40,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:32:40,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-07 09:32:40,112 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 09:32:52,839 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 144 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 09:32:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:53,220 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2024-11-07 09:32:53,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:32:53,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-11-07 09:32:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:53,226 INFO L225 Difference]: With dead ends: 95 [2024-11-07 09:32:53,226 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 09:32:53,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-11-07 09:32:53,227 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 33 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:53,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 315 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 09:32:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 09:32:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2024-11-07 09:32:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 09:32:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2024-11-07 09:32:53,237 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 114 [2024-11-07 09:32:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:53,238 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2024-11-07 09:32:53,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 09:32:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2024-11-07 09:32:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 09:32:53,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:53,240 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:53,245 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 (5)] Ended with exit code 0 [2024-11-07 09:32:53,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 09:32:53,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:53,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash 507122809, now seen corresponding path program 1 times [2024-11-07 09:32:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:32:53,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948668887] [2024-11-07 09:32:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:53,442 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 09:32:53,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:32:53,444 INFO L229 MonitoredProcess]: Starting monitored process 6 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 09:32:53,445 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 (6)] Waiting until timeout for monitored process [2024-11-07 09:32:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:53,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 09:32:53,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:33:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 326 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-07 09:33:04,253 INFO L311 TraceCheckSpWp]: Computing backward predicates...