./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-76.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_floatingpointinfluence_has-floats_file-76.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', '668406c060c4d5d195fc7696a302d1e12de395be857d770331d525cc15c19b43'] 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_floatingpointinfluence_has-floats_file-76.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 668406c060c4d5d195fc7696a302d1e12de395be857d770331d525cc15c19b43 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:41:45,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:41:45,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:41:45,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:41:45,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:41:45,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:41:45,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:41:45,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:41:45,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:41:45,698 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:41:45,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:41:45,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:41:45,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:41:45,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:41:45,699 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:41:45,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:41:45,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:41:45,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:41:45,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:41:45,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:41:45,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:41:45,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:41:45,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:41:45,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:41:45,701 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:41:45,701 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:41:45,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:41:45,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:41:45,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:41:45,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:41:45,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:41:45,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:41:45,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:41:45,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:41:45,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:41:45,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:41:45,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:41:45,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:41:45,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:41:45,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:41:45,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:41:45,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:41:45,703 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 -> 668406c060c4d5d195fc7696a302d1e12de395be857d770331d525cc15c19b43 [2024-11-07 07:41:46,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:41:46,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:41:46,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:41:46,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:41:46,022 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:41:46,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-76.i [2024-11-07 07:41:47,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:41:47,577 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:41:47,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-76.i [2024-11-07 07:41:47,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f35bcc88/d0765c31a0054426afbb326ae46cc7ba/FLAG724b2e900 [2024-11-07 07:41:47,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f35bcc88/d0765c31a0054426afbb326ae46cc7ba [2024-11-07 07:41:47,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:41:47,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:41:47,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:41:47,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:41:47,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:41:47,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:47,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a76e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47, skipping insertion in model container [2024-11-07 07:41:47,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:47,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:41:47,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-76.i[917,930] [2024-11-07 07:41:47,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:41:47,849 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:41:47,862 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_floatingpointinfluence_has-floats_file-76.i[917,930] [2024-11-07 07:41:47,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:41:47,916 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:41:47,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47 WrapperNode [2024-11-07 07:41:47,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:41:47,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:41:47,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:41:47,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:41:47,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:47,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:47,979 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-07 07:41:47,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:41:47,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:41:47,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:41:47,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:41:47,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:47,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:47,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:48,016 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 07:41:48,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:48,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:48,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:48,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:48,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:48,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:48,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:41:48,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:41:48,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:41:48,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:41:48,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (1/1) ... [2024-11-07 07:41:48,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:41:48,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:41:48,084 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 07:41:48,087 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 07:41:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:41:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:41:48,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:41:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:41:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:41:48,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:41:48,201 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:41:48,203 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:41:48,420 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 07:41:48,420 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:41:48,432 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:41:48,432 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:41:48,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:41:48 BoogieIcfgContainer [2024-11-07 07:41:48,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:41:48,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:41:48,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:41:48,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:41:48,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:41:47" (1/3) ... [2024-11-07 07:41:48,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d96173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:41:48, skipping insertion in model container [2024-11-07 07:41:48,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:47" (2/3) ... [2024-11-07 07:41:48,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d96173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:41:48, skipping insertion in model container [2024-11-07 07:41:48,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:41:48" (3/3) ... [2024-11-07 07:41:48,445 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-76.i [2024-11-07 07:41:48,460 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:41:48,460 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:41:48,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:41:48,536 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;@4d560067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:41:48,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:41:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 07:41:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 07:41:48,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:41:48,554 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:41:48,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:41:48,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:41:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash -286747828, now seen corresponding path program 1 times [2024-11-07 07:41:48,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:41:48,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670828801] [2024-11-07 07:41:48,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:41:48,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:41:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:41:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:41:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:41:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:41:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:41:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:41:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:41:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:41:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:41:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:41:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:41:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:41:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:41:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:41:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:41:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:41:48,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:41:48,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670828801] [2024-11-07 07:41:48,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670828801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:41:48,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:41:48,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:41:48,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979381107] [2024-11-07 07:41:48,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:41:48,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:41:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:41:48,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:41:48,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:41:48,974 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:41:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:41:49,001 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2024-11-07 07:41:49,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:41:49,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-07 07:41:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:41:49,011 INFO L225 Difference]: With dead ends: 95 [2024-11-07 07:41:49,011 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 07:41:49,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:41:49,018 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:41:49,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:41:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 07:41:49,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 07:41:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 07:41:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-07 07:41:49,059 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 97 [2024-11-07 07:41:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:41:49,060 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-07 07:41:49,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:41:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-07 07:41:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 07:41:49,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:41:49,064 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:41:49,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:41:49,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:41:49,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:41:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash 357321277, now seen corresponding path program 1 times [2024-11-07 07:41:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:41:49,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379492203] [2024-11-07 07:41:49,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:41:49,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:41:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:41:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:41:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:41:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:41:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:41:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:41:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:41:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:41:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:41:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:41:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:41:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:41:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:41:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:41:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:41:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:41:49,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:41:49,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379492203] [2024-11-07 07:41:49,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379492203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:41:49,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:41:49,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:41:49,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090574664] [2024-11-07 07:41:49,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:41:49,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:41:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:41:49,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:41:49,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:41:49,327 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:41:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:41:49,361 INFO L93 Difference]: Finished difference Result 91 states and 133 transitions. [2024-11-07 07:41:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:41:49,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-07 07:41:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:41:49,364 INFO L225 Difference]: With dead ends: 91 [2024-11-07 07:41:49,364 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 07:41:49,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:41:49,366 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:41:49,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:41:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 07:41:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 07:41:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 07:41:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-11-07 07:41:49,377 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 98 [2024-11-07 07:41:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:41:49,377 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-11-07 07:41:49,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:41:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-11-07 07:41:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 07:41:49,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:41:49,384 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:41:49,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:41:49,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:41:49,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:41:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash -35705733, now seen corresponding path program 1 times [2024-11-07 07:41:49,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:41:49,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859326698] [2024-11-07 07:41:49,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:41:49,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:41:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:41:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:41:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:41:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:41:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:41:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:41:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:41:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:41:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:41:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:41:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:41:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:41:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:41:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:41:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:41:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:41:49,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:41:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859326698] [2024-11-07 07:41:49,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859326698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:41:49,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:41:49,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:41:49,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424113983] [2024-11-07 07:41:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:41:49,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:41:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:41:49,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:41:49,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:41:49,626 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:41:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:41:49,657 INFO L93 Difference]: Finished difference Result 91 states and 131 transitions. [2024-11-07 07:41:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:41:49,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-07 07:41:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:41:49,661 INFO L225 Difference]: With dead ends: 91 [2024-11-07 07:41:49,663 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 07:41:49,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:41:49,666 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:41:49,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:41:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 07:41:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 07:41:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 07:41:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2024-11-07 07:41:49,674 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 98 [2024-11-07 07:41:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:41:49,675 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2024-11-07 07:41:49,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:41:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2024-11-07 07:41:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 07:41:49,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:41:49,676 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:41:49,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:41:49,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:41:49,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:41:49,677 INFO L85 PathProgramCache]: Analyzing trace with hash -105577621, now seen corresponding path program 1 times [2024-11-07 07:41:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:41:49,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214274624] [2024-11-07 07:41:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:41:49,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:41:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:41:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:41:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:41:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:41:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:41:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:41:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:41:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:41:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:41:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:41:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:41:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:41:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:41:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:41:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:41:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:41:49,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:41:49,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214274624] [2024-11-07 07:41:49,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214274624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:41:49,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:41:49,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:41:49,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785781444] [2024-11-07 07:41:49,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:41:49,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:41:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:41:49,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:41:49,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:41:49,859 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:41:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:41:49,914 INFO L93 Difference]: Finished difference Result 131 states and 185 transitions. [2024-11-07 07:41:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:41:49,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-07 07:41:49,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:41:49,916 INFO L225 Difference]: With dead ends: 131 [2024-11-07 07:41:49,916 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 07:41:49,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:41:49,917 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 56 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:41:49,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 125 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:41:49,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 07:41:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2024-11-07 07:41:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 07:41:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2024-11-07 07:41:49,935 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 99 [2024-11-07 07:41:49,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:41:49,936 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2024-11-07 07:41:49,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:41:49,936 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2024-11-07 07:41:49,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 07:41:49,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:41:49,939 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:41:49,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:41:49,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:41:49,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:41:49,943 INFO L85 PathProgramCache]: Analyzing trace with hash -48319319, now seen corresponding path program 1 times [2024-11-07 07:41:49,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:41:49,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114686951] [2024-11-07 07:41:49,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:41:49,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:41:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:41:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:41:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:41:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:41:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:41:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:41:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:41:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:41:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:41:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:41:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:41:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:41:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:41:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:41:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:41:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:41:51,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:41:51,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114686951] [2024-11-07 07:41:51,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114686951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:41:51,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:41:51,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:41:51,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761587393] [2024-11-07 07:41:51,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:41:51,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:41:51,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:41:51,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:41:51,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:41:51,421 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:41:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:41:51,725 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2024-11-07 07:41:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:41:51,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-07 07:41:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:41:51,727 INFO L225 Difference]: With dead ends: 137 [2024-11-07 07:41:51,727 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 07:41:51,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:41:51,728 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 84 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:41:51,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 263 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:41:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 07:41:51,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2024-11-07 07:41:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 07:41:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2024-11-07 07:41:51,755 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 99 [2024-11-07 07:41:51,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:41:51,756 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2024-11-07 07:41:51,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:41:51,757 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2024-11-07 07:41:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 07:41:51,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:41:51,760 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:41:51,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:41:51,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:41:51,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:41:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash 786500757, now seen corresponding path program 1 times [2024-11-07 07:41:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:41:51,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905441607] [2024-11-07 07:41:51,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:41:51,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:41:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:41:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:41:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:51,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:41:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:41:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:41:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:41:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:41:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:41:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:41:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:41:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:41:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:41:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:41:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:41:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:41:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-07 07:41:52,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:41:52,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905441607] [2024-11-07 07:41:52,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905441607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:41:52,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77853574] [2024-11-07 07:41:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:41:52,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:41:52,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:41:52,092 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 07:41:52,094 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 07:41:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:52,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 07:41:52,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:41:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 204 proven. 27 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-07 07:41:52,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:41:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-07 07:41:52,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77853574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:41:52,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:41:52,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-07 07:41:52,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026065888] [2024-11-07 07:41:52,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:41:52,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:41:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:41:52,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:41:52,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:41:52,633 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 07:41:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:41:52,997 INFO L93 Difference]: Finished difference Result 189 states and 241 transitions. [2024-11-07 07:41:52,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 07:41:52,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 100 [2024-11-07 07:41:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:41:53,000 INFO L225 Difference]: With dead ends: 189 [2024-11-07 07:41:53,001 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 07:41:53,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-07 07:41:53,002 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 98 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:41:53,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 165 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:41:53,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 07:41:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 70. [2024-11-07 07:41:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 49 states have internal predecessors, (50), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 07:41:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2024-11-07 07:41:53,018 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 100 [2024-11-07 07:41:53,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:41:53,018 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2024-11-07 07:41:53,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 07:41:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2024-11-07 07:41:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 07:41:53,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:41:53,019 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:41:53,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 07:41:53,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:41:53,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:41:53,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:41:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash 216621469, now seen corresponding path program 1 times [2024-11-07 07:41:53,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:41:53,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587276658] [2024-11-07 07:41:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:41:53,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:41:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:41:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:41:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:41:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:41:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:41:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:41:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:41:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:41:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:41:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:41:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:41:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:41:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:41:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:41:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:41:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:41:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:41:54,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:41:54,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587276658] [2024-11-07 07:41:54,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587276658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:41:54,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:41:54,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:41:54,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23567497] [2024-11-07 07:41:54,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:41:54,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:41:54,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:41:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:41:54,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:41:54,258 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:41:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:41:54,476 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2024-11-07 07:41:54,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:41:54,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-11-07 07:41:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:41:54,479 INFO L225 Difference]: With dead ends: 83 [2024-11-07 07:41:54,479 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 07:41:54,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:41:54,480 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 53 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:41:54,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 238 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:41:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 07:41:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 07:41:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 07:41:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 07:41:54,482 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2024-11-07 07:41:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:41:54,482 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 07:41:54,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:41:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 07:41:54,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 07:41:54,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:41:54,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:41:54,488 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:41:54,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 07:41:55,080 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:41:55,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:41:55 BoogieIcfgContainer [2024-11-07 07:41:55,102 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:41:55,103 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:41:55,103 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:41:55,103 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:41:55,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:41:48" (3/4) ... [2024-11-07 07:41:55,107 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 07:41:55,112 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 07:41:55,117 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 07:41:55,118 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 07:41:55,118 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 07:41:55,118 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 07:41:55,201 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 07:41:55,202 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 07:41:55,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:41:55,203 INFO L158 Benchmark]: Toolchain (without parser) took 7593.58ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 77.2MB in the beginning and 62.7MB in the end (delta: 14.5MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2024-11-07 07:41:55,203 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:41:55,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.60ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 64.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:41:55,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.48ms. Allocated memory is still 100.7MB. Free memory was 64.5MB in the beginning and 62.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:41:55,204 INFO L158 Benchmark]: Boogie Preprocessor took 66.75ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 60.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:41:55,204 INFO L158 Benchmark]: RCFGBuilder took 385.45ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 46.3MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:41:55,204 INFO L158 Benchmark]: TraceAbstraction took 6666.63ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 45.8MB in the beginning and 69.4MB in the end (delta: -23.7MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2024-11-07 07:41:55,205 INFO L158 Benchmark]: Witness Printer took 99.25ms. Allocated memory is still 151.0MB. Free memory was 69.4MB in the beginning and 62.7MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:41:55,206 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.21ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.60ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 64.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.48ms. Allocated memory is still 100.7MB. Free memory was 64.5MB in the beginning and 62.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.75ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 60.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 385.45ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 46.3MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6666.63ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 45.8MB in the beginning and 69.4MB in the end (delta: -23.7MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * Witness Printer took 99.25ms. Allocated memory is still 151.0MB. Free memory was 69.4MB in the beginning and 62.7MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 7, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 1110 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 653 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 409 IncrementalHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 457 mSDtfsCounter, 409 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 422 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=5, InterpolantAutomatonStates: 44, 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, 7 MinimizatonAttempts, 95 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 791 NumberOfCodeBlocks, 791 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 882 ConstructedInterpolants, 0 QuantifiedInterpolants, 2058 SizeOfPredicates, 2 NumberOfNonLiveVariables, 232 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 3699/3780 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((var_1_5 <= 0) && ((var_1_4 != var_1_10) || (((((240 + var_1_11) % 256) == var_1_8) || ((128 <= ((240 + var_1_11) % 256)) && (((240 + var_1_11) % 256) == (256 + var_1_8)))) && ((((240 + var_1_11) % 256) < 128) || (((240 + var_1_11) % 256) != var_1_8))))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (last_1_var_1_8 == \old(last_1_var_1_8)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 07:41:55,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE