./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/hardware-verification-bv/btor2c-lazyMod.mul4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:39:53,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:39:53,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 07:39:53,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:39:53,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:39:53,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:39:53,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:39:53,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:39:53,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:39:53,475 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:39:53,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:39:53,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:39:53,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:39:53,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:39:53,475 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:39:53,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:39:53,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:39:53,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 07:39:53,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:39:53,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:39:53,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:39:53,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:39:53,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:39:53,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:39:53,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:39:53,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:39:53,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:39:53,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:39:53,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:39:53,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:39:53,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:39:53,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:39:53,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:39:53,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:39:53,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:39:53,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:39:53,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:39:53,478 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:39:53,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:39:53,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 07:39:53,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 07:39:53,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:39:53,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:39:53,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:39:53,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:39:53,478 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2025-01-09 07:39:53,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:39:53,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:39:53,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:39:53,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:39:53,724 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:39:53,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2025-01-09 07:39:54,926 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ef425dd9/73bd50a4c28e480fad0a5e9d4bc03a8b/FLAG054ce19a5 [2025-01-09 07:39:54,943 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-01-09 07:39:55,225 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:39:55,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2025-01-09 07:39:55,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ef425dd9/73bd50a4c28e480fad0a5e9d4bc03a8b/FLAG054ce19a5 [2025-01-09 07:39:55,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ef425dd9/73bd50a4c28e480fad0a5e9d4bc03a8b [2025-01-09 07:39:55,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:39:55,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:39:55,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:39:55,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:39:55,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:39:55,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136b7b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55, skipping insertion in model container [2025-01-09 07:39:55,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:39:55,415 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/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2025-01-09 07:39:55,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:39:55,512 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:39:55,519 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/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2025-01-09 07:39:55,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:39:55,558 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:39:55,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55 WrapperNode [2025-01-09 07:39:55,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:39:55,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:39:55,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:39:55,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:39:55,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,630 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 642 [2025-01-09 07:39:55,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:39:55,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:39:55,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:39:55,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:39:55,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,668 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-01-09 07:39:55,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:39:55,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:39:55,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:39:55,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:39:55,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (1/1) ... [2025-01-09 07:39:55,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:39:55,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:39:55,738 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) [2025-01-09 07:39:55,740 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 [2025-01-09 07:39:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:39:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 07:39:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 07:39:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:39:55,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:39:55,830 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:39:55,831 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:39:56,543 INFO L? ?]: Removed 297 outVars from TransFormulas that were not future-live. [2025-01-09 07:39:56,543 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:39:56,555 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:39:56,557 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:39:56,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:39:56 BoogieIcfgContainer [2025-01-09 07:39:56,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:39:56,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:39:56,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:39:56,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:39:56,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:39:55" (1/3) ... [2025-01-09 07:39:56,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1059b567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:39:56, skipping insertion in model container [2025-01-09 07:39:56,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:55" (2/3) ... [2025-01-09 07:39:56,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1059b567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:39:56, skipping insertion in model container [2025-01-09 07:39:56,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:39:56" (3/3) ... [2025-01-09 07:39:56,566 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2025-01-09 07:39:56,576 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:39:56,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul4.c that has 1 procedures, 182 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:39:56,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:39:56,642 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;@131dad21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:39:56,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:39:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 181 states have internal predecessors, (269), 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) [2025-01-09 07:39:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 07:39:56,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:56,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:56,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:56,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash -461519839, now seen corresponding path program 1 times [2025-01-09 07:39:56,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:56,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041962780] [2025-01-09 07:39:56,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:56,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 07:39:56,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 07:39:56,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:56,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:39:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:39:57,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:39:57,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041962780] [2025-01-09 07:39:57,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041962780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:39:57,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:39:57,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:39:57,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091427121] [2025-01-09 07:39:57,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:39:57,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:39:57,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:39:57,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:39:57,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:39:57,430 INFO L87 Difference]: Start difference. First operand has 182 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 181 states have internal predecessors, (269), 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) Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2025-01-09 07:39:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:39:57,483 INFO L93 Difference]: Finished difference Result 297 states and 441 transitions. [2025-01-09 07:39:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:39:57,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) Word has length 65 [2025-01-09 07:39:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:39:57,490 INFO L225 Difference]: With dead ends: 297 [2025-01-09 07:39:57,490 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 07:39:57,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:39:57,494 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:39:57,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 783 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:39:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 07:39:57,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-01-09 07:39:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 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) [2025-01-09 07:39:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 267 transitions. [2025-01-09 07:39:57,524 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 267 transitions. Word has length 65 [2025-01-09 07:39:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:39:57,525 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 267 transitions. [2025-01-09 07:39:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2025-01-09 07:39:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 267 transitions. [2025-01-09 07:39:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 07:39:57,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:57,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:57,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 07:39:57,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:57,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:57,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1420517578, now seen corresponding path program 1 times [2025-01-09 07:39:57,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:57,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605063254] [2025-01-09 07:39:57,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:57,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:57,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 07:39:57,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 07:39:57,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:57,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:39:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:39:57,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:39:57,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605063254] [2025-01-09 07:39:57,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605063254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:39:57,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:39:57,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:39:57,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389616927] [2025-01-09 07:39:57,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:39:57,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:39:57,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:39:57,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:39:57,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:39:57,754 INFO L87 Difference]: Start difference. First operand 181 states and 267 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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) [2025-01-09 07:39:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:39:57,782 INFO L93 Difference]: Finished difference Result 298 states and 439 transitions. [2025-01-09 07:39:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:39:57,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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) Word has length 66 [2025-01-09 07:39:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:39:57,783 INFO L225 Difference]: With dead ends: 298 [2025-01-09 07:39:57,784 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 07:39:57,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:39:57,784 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:39:57,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 779 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:39:57,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 07:39:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-01-09 07:39:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.478021978021978) internal successors, (269), 182 states have internal predecessors, (269), 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) [2025-01-09 07:39:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 269 transitions. [2025-01-09 07:39:57,790 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 269 transitions. Word has length 66 [2025-01-09 07:39:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:39:57,790 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 269 transitions. [2025-01-09 07:39:57,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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) [2025-01-09 07:39:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 269 transitions. [2025-01-09 07:39:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 07:39:57,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:57,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:57,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 07:39:57,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:57,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:57,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2110629786, now seen corresponding path program 1 times [2025-01-09 07:39:57,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:57,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384146679] [2025-01-09 07:39:57,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:57,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:57,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 07:39:57,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 07:39:57,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:57,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:39:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:39:58,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:39:58,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384146679] [2025-01-09 07:39:58,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384146679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:39:58,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:39:58,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:39:58,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354945644] [2025-01-09 07:39:58,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:39:58,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:39:58,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:39:58,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:39:58,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:39:58,255 INFO L87 Difference]: Start difference. First operand 183 states and 269 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2025-01-09 07:39:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:39:58,302 INFO L93 Difference]: Finished difference Result 304 states and 446 transitions. [2025-01-09 07:39:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:39:58,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) Word has length 67 [2025-01-09 07:39:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:39:58,304 INFO L225 Difference]: With dead ends: 304 [2025-01-09 07:39:58,305 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 07:39:58,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:39:58,306 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 212 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:39:58,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 775 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:39:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 07:39:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2025-01-09 07:39:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.4702702702702704) internal successors, (272), 185 states have internal predecessors, (272), 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) [2025-01-09 07:39:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 272 transitions. [2025-01-09 07:39:58,318 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 272 transitions. Word has length 67 [2025-01-09 07:39:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:39:58,319 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 272 transitions. [2025-01-09 07:39:58,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2025-01-09 07:39:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2025-01-09 07:39:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 07:39:58,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:58,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:58,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 07:39:58,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:58,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1725407879, now seen corresponding path program 1 times [2025-01-09 07:39:58,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:58,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875504893] [2025-01-09 07:39:58,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:58,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:58,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 07:39:58,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 07:39:58,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:58,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:39:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:39:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:39:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875504893] [2025-01-09 07:39:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875504893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:39:59,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:39:59,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 07:39:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798041516] [2025-01-09 07:39:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:39:59,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 07:39:59,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:39:59,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 07:39:59,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 07:39:59,096 INFO L87 Difference]: Start difference. First operand 186 states and 272 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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) [2025-01-09 07:39:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:39:59,169 INFO L93 Difference]: Finished difference Result 329 states and 479 transitions. [2025-01-09 07:39:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 07:39:59,170 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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) Word has length 68 [2025-01-09 07:39:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:39:59,172 INFO L225 Difference]: With dead ends: 329 [2025-01-09 07:39:59,172 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 07:39:59,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 07:39:59,175 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 24 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:39:59,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1530 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:39:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 07:39:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 194. [2025-01-09 07:39:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 193 states have internal predecessors, (283), 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) [2025-01-09 07:39:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2025-01-09 07:39:59,187 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 68 [2025-01-09 07:39:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:39:59,187 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2025-01-09 07:39:59,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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) [2025-01-09 07:39:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2025-01-09 07:39:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 07:39:59,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:59,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:59,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 07:39:59,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:59,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:59,189 INFO L85 PathProgramCache]: Analyzing trace with hash -158687039, now seen corresponding path program 1 times [2025-01-09 07:39:59,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:59,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818057914] [2025-01-09 07:39:59,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:59,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:59,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 07:39:59,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 07:39:59,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:59,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:39:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:39:59,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:39:59,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818057914] [2025-01-09 07:39:59,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818057914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:39:59,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:39:59,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 07:39:59,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424918697] [2025-01-09 07:39:59,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:39:59,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 07:39:59,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:39:59,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 07:39:59,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:39:59,641 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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) [2025-01-09 07:39:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:39:59,718 INFO L93 Difference]: Finished difference Result 340 states and 494 transitions. [2025-01-09 07:39:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 07:39:59,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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) Word has length 69 [2025-01-09 07:39:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:39:59,719 INFO L225 Difference]: With dead ends: 340 [2025-01-09 07:39:59,719 INFO L226 Difference]: Without dead ends: 212 [2025-01-09 07:39:59,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:39:59,720 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 21 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:39:59,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1521 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:39:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-01-09 07:39:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200. [2025-01-09 07:39:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.4623115577889447) internal successors, (291), 199 states have internal predecessors, (291), 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) [2025-01-09 07:39:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2025-01-09 07:39:59,724 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 69 [2025-01-09 07:39:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:39:59,725 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2025-01-09 07:39:59,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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) [2025-01-09 07:39:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2025-01-09 07:39:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 07:39:59,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:59,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:59,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 07:39:59,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:59,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash -814345339, now seen corresponding path program 1 times [2025-01-09 07:39:59,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:59,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670549173] [2025-01-09 07:39:59,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:59,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 07:39:59,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 07:39:59,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:59,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:00,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:40:00,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670549173] [2025-01-09 07:40:00,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670549173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:40:00,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:40:00,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 07:40:00,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930809814] [2025-01-09 07:40:00,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:40:00,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 07:40:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:40:00,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 07:40:00,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:40:00,063 INFO L87 Difference]: Start difference. First operand 200 states and 291 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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) [2025-01-09 07:40:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:40:00,141 INFO L93 Difference]: Finished difference Result 332 states and 482 transitions. [2025-01-09 07:40:00,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 07:40:00,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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) Word has length 69 [2025-01-09 07:40:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:40:00,143 INFO L225 Difference]: With dead ends: 332 [2025-01-09 07:40:00,143 INFO L226 Difference]: Without dead ends: 198 [2025-01-09 07:40:00,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 07:40:00,143 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 214 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:40:00,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1703 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:40:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-09 07:40:00,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2025-01-09 07:40:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 194 states have internal predecessors, (284), 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) [2025-01-09 07:40:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 284 transitions. [2025-01-09 07:40:00,147 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 284 transitions. Word has length 69 [2025-01-09 07:40:00,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:40:00,148 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 284 transitions. [2025-01-09 07:40:00,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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) [2025-01-09 07:40:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 284 transitions. [2025-01-09 07:40:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 07:40:00,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:00,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:00,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 07:40:00,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:00,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:00,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1464837146, now seen corresponding path program 1 times [2025-01-09 07:40:00,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:40:00,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014680502] [2025-01-09 07:40:00,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:00,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:40:00,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 07:40:00,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 07:40:00,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:00,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:00,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:40:00,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014680502] [2025-01-09 07:40:00,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014680502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:40:00,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:40:00,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:40:00,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352378630] [2025-01-09 07:40:00,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:40:00,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:40:00,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:40:00,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:40:00,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:40:00,374 INFO L87 Difference]: Start difference. First operand 195 states and 284 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2025-01-09 07:40:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:40:00,431 INFO L93 Difference]: Finished difference Result 443 states and 641 transitions. [2025-01-09 07:40:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:40:00,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) Word has length 69 [2025-01-09 07:40:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:40:00,435 INFO L225 Difference]: With dead ends: 443 [2025-01-09 07:40:00,435 INFO L226 Difference]: Without dead ends: 314 [2025-01-09 07:40:00,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:40:00,435 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 364 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:40:00,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 759 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:40:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-01-09 07:40:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 231. [2025-01-09 07:40:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4608695652173913) internal successors, (336), 230 states have internal predecessors, (336), 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) [2025-01-09 07:40:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 336 transitions. [2025-01-09 07:40:00,445 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 336 transitions. Word has length 69 [2025-01-09 07:40:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:40:00,446 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 336 transitions. [2025-01-09 07:40:00,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2025-01-09 07:40:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 336 transitions. [2025-01-09 07:40:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 07:40:00,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:00,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:00,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 07:40:00,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:00,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:00,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1696516813, now seen corresponding path program 1 times [2025-01-09 07:40:00,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:40:00,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128429134] [2025-01-09 07:40:00,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:00,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:40:00,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 07:40:00,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 07:40:00,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:00,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:40:00,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128429134] [2025-01-09 07:40:00,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128429134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:40:00,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:40:00,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:40:00,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034189494] [2025-01-09 07:40:00,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:40:00,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:40:00,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:40:00,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:40:00,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:40:00,683 INFO L87 Difference]: Start difference. First operand 231 states and 336 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2025-01-09 07:40:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:40:00,791 INFO L93 Difference]: Finished difference Result 401 states and 575 transitions. [2025-01-09 07:40:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:40:00,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) Word has length 69 [2025-01-09 07:40:00,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:40:00,792 INFO L225 Difference]: With dead ends: 401 [2025-01-09 07:40:00,792 INFO L226 Difference]: Without dead ends: 268 [2025-01-09 07:40:00,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:40:00,793 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 296 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:40:00,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 955 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:40:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-09 07:40:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 229. [2025-01-09 07:40:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4517543859649122) internal successors, (331), 228 states have internal predecessors, (331), 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) [2025-01-09 07:40:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 331 transitions. [2025-01-09 07:40:00,801 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 331 transitions. Word has length 69 [2025-01-09 07:40:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:40:00,802 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 331 transitions. [2025-01-09 07:40:00,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2025-01-09 07:40:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 331 transitions. [2025-01-09 07:40:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 07:40:00,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:00,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:00,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 07:40:00,802 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:00,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1079174156, now seen corresponding path program 1 times [2025-01-09 07:40:00,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:40:00,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17552643] [2025-01-09 07:40:00,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:00,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:40:00,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 07:40:00,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 07:40:00,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:00,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:01,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:40:01,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17552643] [2025-01-09 07:40:01,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17552643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:40:01,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:40:01,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:40:01,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151460013] [2025-01-09 07:40:01,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:40:01,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:40:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:40:01,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:40:01,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:40:01,013 INFO L87 Difference]: Start difference. First operand 229 states and 331 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2025-01-09 07:40:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:40:01,049 INFO L93 Difference]: Finished difference Result 433 states and 620 transitions. [2025-01-09 07:40:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:40:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) Word has length 69 [2025-01-09 07:40:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:40:01,050 INFO L225 Difference]: With dead ends: 433 [2025-01-09 07:40:01,051 INFO L226 Difference]: Without dead ends: 298 [2025-01-09 07:40:01,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:40:01,051 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 454 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:40:01,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 764 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:40:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-01-09 07:40:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 227. [2025-01-09 07:40:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4424778761061947) internal successors, (326), 226 states have internal predecessors, (326), 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) [2025-01-09 07:40:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 326 transitions. [2025-01-09 07:40:01,056 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 326 transitions. Word has length 69 [2025-01-09 07:40:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:40:01,056 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 326 transitions. [2025-01-09 07:40:01,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2025-01-09 07:40:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 326 transitions. [2025-01-09 07:40:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 07:40:01,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:01,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:01,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 07:40:01,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:01,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:01,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1343504549, now seen corresponding path program 1 times [2025-01-09 07:40:01,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:40:01,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095604921] [2025-01-09 07:40:01,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:40:01,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 07:40:01,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 07:40:01,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:01,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:40:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095604921] [2025-01-09 07:40:01,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095604921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:40:01,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:40:01,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:40:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785973831] [2025-01-09 07:40:01,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:40:01,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:40:01,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:40:01,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:40:01,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:40:01,245 INFO L87 Difference]: Start difference. First operand 227 states and 326 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2025-01-09 07:40:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:40:01,278 INFO L93 Difference]: Finished difference Result 356 states and 512 transitions. [2025-01-09 07:40:01,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:40:01,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) Word has length 69 [2025-01-09 07:40:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:40:01,279 INFO L225 Difference]: With dead ends: 356 [2025-01-09 07:40:01,279 INFO L226 Difference]: Without dead ends: 219 [2025-01-09 07:40:01,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:40:01,280 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 247 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:40:01,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 763 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:40:01,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-01-09 07:40:01,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-01-09 07:40:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.4495412844036697) internal successors, (316), 218 states have internal predecessors, (316), 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) [2025-01-09 07:40:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2025-01-09 07:40:01,284 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 69 [2025-01-09 07:40:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:40:01,284 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2025-01-09 07:40:01,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2025-01-09 07:40:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2025-01-09 07:40:01,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 07:40:01,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:01,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:01,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 07:40:01,285 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:01,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:01,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2025898208, now seen corresponding path program 1 times [2025-01-09 07:40:01,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:40:01,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528028066] [2025-01-09 07:40:01,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:01,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:40:01,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 07:40:01,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 07:40:01,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:01,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:01,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:40:01,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528028066] [2025-01-09 07:40:01,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528028066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:40:01,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:40:01,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:40:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902889791] [2025-01-09 07:40:01,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:40:01,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:40:01,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:40:01,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:40:01,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:40:01,479 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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) [2025-01-09 07:40:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:40:01,516 INFO L93 Difference]: Finished difference Result 387 states and 553 transitions. [2025-01-09 07:40:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:40:01,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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) Word has length 70 [2025-01-09 07:40:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:40:01,517 INFO L225 Difference]: With dead ends: 387 [2025-01-09 07:40:01,517 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 07:40:01,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:40:01,518 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 334 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:40:01,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 760 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:40:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 07:40:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 227. [2025-01-09 07:40:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4380530973451326) internal successors, (325), 226 states have internal predecessors, (325), 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) [2025-01-09 07:40:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 325 transitions. [2025-01-09 07:40:01,522 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 325 transitions. Word has length 70 [2025-01-09 07:40:01,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:40:01,523 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 325 transitions. [2025-01-09 07:40:01,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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) [2025-01-09 07:40:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 325 transitions. [2025-01-09 07:40:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 07:40:01,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:01,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:01,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 07:40:01,524 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:01,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2089643758, now seen corresponding path program 1 times [2025-01-09 07:40:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:40:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929631798] [2025-01-09 07:40:01,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:01,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:40:01,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 07:40:01,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 07:40:01,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:01,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:40:01,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 07:40:01,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 07:40:01,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 07:40:01,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:01,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:40:01,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 07:40:01,590 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 07:40:01,591 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 07:40:01,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 07:40:01,594 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:01,637 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 07:40:01,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 07:40:01 BoogieIcfgContainer [2025-01-09 07:40:01,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 07:40:01,640 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 07:40:01,640 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 07:40:01,640 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 07:40:01,641 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:39:56" (3/4) ... [2025-01-09 07:40:01,642 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 07:40:01,643 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 07:40:01,643 INFO L158 Benchmark]: Toolchain (without parser) took 6379.71ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 123.3MB in the beginning and 347.9MB in the end (delta: -224.6MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2025-01-09 07:40:01,643 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:40:01,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.45ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 105.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 07:40:01,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.68ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 96.6MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 07:40:01,644 INFO L158 Benchmark]: Boogie Preprocessor took 68.84ms. Allocated memory is still 167.8MB. Free memory was 96.6MB in the beginning and 90.7MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 07:40:01,644 INFO L158 Benchmark]: RCFGBuilder took 857.67ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 106.3MB in the end (delta: -15.6MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2025-01-09 07:40:01,644 INFO L158 Benchmark]: TraceAbstraction took 5080.76ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 105.5MB in the beginning and 348.0MB in the end (delta: -242.5MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2025-01-09 07:40:01,644 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 436.2MB. Free memory was 348.0MB in the beginning and 347.9MB in the end (delta: 58.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:40:01,645 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.45ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 105.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.68ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 96.6MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.84ms. Allocated memory is still 167.8MB. Free memory was 96.6MB in the beginning and 90.7MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 857.67ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 106.3MB in the end (delta: -15.6MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5080.76ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 105.5MB in the beginning and 348.0MB in the end (delta: -242.5MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 436.2MB. Free memory was 348.0MB in the beginning and 347.9MB in the end (delta: 58.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 168. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 32); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 64); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (64 - 1); [L35] const SORT_64 mask_SORT_64 = (SORT_64)-1 >> (sizeof(SORT_64) * 8 - 4); [L36] const SORT_64 msb_SORT_64 = (SORT_64)1 << (4 - 1); [L38] const SORT_66 mask_SORT_66 = (SORT_66)-1 >> (sizeof(SORT_66) * 8 - 60); [L39] const SORT_66 msb_SORT_66 = (SORT_66)1 << (60 - 1); [L41] const SORT_10 var_11 = 0; [L42] const SORT_1 var_14 = 0; [L43] const SORT_3 var_24 = 0; [L44] const SORT_1 var_51 = 1; [L45] const SORT_64 var_65 = 0; [L47] SORT_1 input_2; [L48] SORT_3 input_4; [L49] SORT_3 input_5; [L50] SORT_1 input_6; [L51] SORT_1 input_7; [L52] SORT_1 input_8; [L53] SORT_1 input_9; [L55] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L55] SORT_10 state_12 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L56] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L57] SORT_10 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L58] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L59] SORT_3 state_25 = __VERIFIER_nondet_uint() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L60] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L61] SORT_3 state_30 = __VERIFIER_nondet_uint() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L62] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L63] SORT_3 state_37 = __VERIFIER_nondet_uint() & mask_SORT_3; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L64] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L65] SORT_3 state_42 = __VERIFIER_nondet_uint() & mask_SORT_3; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L66] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L67] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L68] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L69] SORT_1 state_87 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L70] SORT_1 state_92 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] SORT_10 init_13_arg_1 = var_11; [L73] state_12 = init_13_arg_1 [L74] SORT_1 init_16_arg_1 = var_14; [L75] state_15 = init_16_arg_1 [L76] SORT_10 init_19_arg_1 = var_11; [L77] state_18 = init_19_arg_1 [L78] SORT_1 init_21_arg_1 = var_14; [L79] state_20 = init_21_arg_1 [L80] SORT_3 init_26_arg_1 = var_24; [L81] state_25 = init_26_arg_1 [L82] SORT_1 init_28_arg_1 = var_14; [L83] state_27 = init_28_arg_1 [L84] SORT_3 init_31_arg_1 = var_24; [L85] state_30 = init_31_arg_1 [L86] SORT_1 init_33_arg_1 = var_14; [L87] state_32 = init_33_arg_1 [L88] SORT_3 init_38_arg_1 = var_24; [L89] state_37 = init_38_arg_1 [L90] SORT_1 init_40_arg_1 = var_14; [L91] state_39 = init_40_arg_1 [L92] SORT_3 init_43_arg_1 = var_24; [L93] state_42 = init_43_arg_1 [L94] SORT_1 init_45_arg_1 = var_14; [L95] state_44 = init_45_arg_1 [L96] SORT_1 init_70_arg_1 = var_14; [L97] state_69 = init_70_arg_1 [L98] SORT_1 init_75_arg_1 = var_14; [L99] state_74 = init_75_arg_1 [L100] SORT_1 init_88_arg_1 = var_14; [L101] state_87 = init_88_arg_1 [L102] SORT_1 init_93_arg_1 = var_14; [L103] state_92 = init_93_arg_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L106] input_2 = __VERIFIER_nondet_uchar() [L107] input_4 = __VERIFIER_nondet_uint() [L108] input_5 = __VERIFIER_nondet_uint() [L109] input_6 = __VERIFIER_nondet_uchar() [L110] EXPR input_6 & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L110] input_6 = input_6 & mask_SORT_1 [L111] input_7 = __VERIFIER_nondet_uchar() [L112] EXPR input_7 & mask_SORT_1 VAL [input_6=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L112] input_7 = input_7 & mask_SORT_1 [L113] input_8 = __VERIFIER_nondet_uchar() [L114] EXPR input_8 & mask_SORT_1 VAL [input_6=0, input_7=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L114] input_8 = input_8 & mask_SORT_1 [L115] input_9 = __VERIFIER_nondet_uchar() [L116] EXPR input_9 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L116] input_9 = input_9 & mask_SORT_1 [L119] SORT_1 var_17_arg_0 = state_15; [L120] SORT_10 var_17_arg_1 = state_12; [L121] SORT_10 var_17_arg_2 = var_11; [L122] SORT_10 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L123] EXPR var_17 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L123] var_17 = var_17 & mask_SORT_10 [L124] SORT_1 var_22_arg_0 = state_20; [L125] SORT_10 var_22_arg_1 = state_18; [L126] SORT_10 var_22_arg_2 = var_11; [L127] SORT_10 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_22=0, var_24=0, var_51=1, var_65=0] [L128] EXPR var_22 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L128] var_22 = var_22 & mask_SORT_10 [L129] SORT_10 var_23_arg_0 = var_17; [L130] SORT_10 var_23_arg_1 = var_22; [L131] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L132] SORT_1 var_29_arg_0 = state_27; [L133] SORT_3 var_29_arg_1 = state_25; [L134] SORT_3 var_29_arg_2 = var_24; [L135] SORT_3 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L136] EXPR var_29 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_51=1, var_65=0] [L136] var_29 = var_29 & mask_SORT_3 [L137] SORT_1 var_34_arg_0 = state_32; [L138] SORT_3 var_34_arg_1 = state_30; [L139] SORT_3 var_34_arg_2 = var_24; [L140] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_34=0, var_51=1, var_65=0] [L141] EXPR var_34 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L141] var_34 = var_34 & mask_SORT_3 [L142] SORT_3 var_35_arg_0 = var_29; [L143] SORT_3 var_35_arg_1 = var_34; [L144] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L145] SORT_1 var_36_arg_0 = var_23; [L146] SORT_1 var_36_arg_1 = var_35; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36_arg_0=1, var_36_arg_1=1, var_51=1, var_65=0] [L147] EXPR var_36_arg_0 & var_36_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L147] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L148] SORT_1 var_41_arg_0 = state_39; [L149] SORT_3 var_41_arg_1 = state_37; [L150] SORT_3 var_41_arg_2 = var_24; [L151] SORT_3 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L152] EXPR var_41 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_51=1, var_65=0] [L152] var_41 = var_41 & mask_SORT_3 [L153] SORT_1 var_46_arg_0 = state_44; [L154] SORT_3 var_46_arg_1 = state_42; [L155] SORT_3 var_46_arg_2 = var_24; [L156] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_46=0, var_51=1, var_65=0] [L157] EXPR var_46 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L157] var_46 = var_46 & mask_SORT_3 [L158] SORT_3 var_47_arg_0 = var_41; [L159] SORT_3 var_47_arg_1 = var_46; [L160] SORT_1 var_47 = var_47_arg_0 == var_47_arg_1; [L161] SORT_1 var_48_arg_0 = var_36; [L162] SORT_1 var_48_arg_1 = var_47; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_48_arg_0=1, var_48_arg_1=1, var_51=1, var_65=0] [L163] EXPR var_48_arg_0 & var_48_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L163] SORT_1 var_48 = var_48_arg_0 & var_48_arg_1; [L164] SORT_1 var_52_arg_0 = var_48; [L165] SORT_1 var_52 = ~var_52_arg_0; [L166] SORT_1 var_53_arg_0 = var_51; [L167] SORT_1 var_53_arg_1 = var_52; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_53_arg_0=1, var_53_arg_1=-2, var_65=0] [L168] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L168] SORT_1 var_53 = var_53_arg_0 & var_53_arg_1; [L169] EXPR var_53 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L169] var_53 = var_53 & mask_SORT_1 [L170] SORT_1 bad_54_arg_0 = var_53; [L171] CALL __VERIFIER_assert(!(bad_54_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 182 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2166 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2166 mSDsluCounter, 11092 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8265 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2827 mSDtfsCounter, 540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=7, InterpolantAutomatonStates: 66, 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, 11 MinimizatonAttempts, 255 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 820 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 1982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 07:40:01,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:40:03,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:40:03,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 07:40:03,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:40:03,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:40:03,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:40:03,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:40:03,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:40:03,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:40:03,912 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:40:03,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:40:03,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:40:03,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:40:03,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:40:03,914 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:40:03,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:40:03,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:40:03,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:40:03,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:40:03,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:40:03,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:40:03,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:40:03,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:40:03,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:40:03,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:40:03,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:40:03,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:40:03,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:40:03,916 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 07:40:03,916 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 07:40:03,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:40:03,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:40:03,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:40:03,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:40:03,916 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2025-01-09 07:40:04,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:40:04,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:40:04,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:40:04,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:40:04,205 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:40:04,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2025-01-09 07:40:05,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f436e30d8/3d13aef0625c43b19aa96464c4600a4b/FLAGacf96a0af [2025-01-09 07:40:05,813 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:40:05,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2025-01-09 07:40:05,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f436e30d8/3d13aef0625c43b19aa96464c4600a4b/FLAGacf96a0af [2025-01-09 07:40:06,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f436e30d8/3d13aef0625c43b19aa96464c4600a4b [2025-01-09 07:40:06,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:40:06,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:40:06,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:40:06,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:40:06,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:40:06,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c90ba55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06, skipping insertion in model container [2025-01-09 07:40:06,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:40:06,369 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/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2025-01-09 07:40:06,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:40:06,470 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:40:06,478 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/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2025-01-09 07:40:06,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:40:06,544 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:40:06,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06 WrapperNode [2025-01-09 07:40:06,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:40:06,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:40:06,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:40:06,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:40:06,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,586 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 298 [2025-01-09 07:40:06,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:40:06,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:40:06,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:40:06,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:40:06,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,617 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-01-09 07:40:06,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,630 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:40:06,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:40:06,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:40:06,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:40:06,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (1/1) ... [2025-01-09 07:40:06,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:40:06,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:40:06,671 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) [2025-01-09 07:40:06,673 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 [2025-01-09 07:40:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:40:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 07:40:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 07:40:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:40:06,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:40:06,789 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:40:06,792 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:40:07,151 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-01-09 07:40:07,151 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:40:07,159 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:40:07,159 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:40:07,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:40:07 BoogieIcfgContainer [2025-01-09 07:40:07,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:40:07,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:40:07,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:40:07,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:40:07,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:40:06" (1/3) ... [2025-01-09 07:40:07,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:40:07, skipping insertion in model container [2025-01-09 07:40:07,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:06" (2/3) ... [2025-01-09 07:40:07,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:40:07, skipping insertion in model container [2025-01-09 07:40:07,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:40:07" (3/3) ... [2025-01-09 07:40:07,168 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2025-01-09 07:40:07,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:40:07,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul4.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:40:07,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:40:07,220 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;@4382ee03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:40:07,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:40:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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) [2025-01-09 07:40:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 07:40:07,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:07,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 07:40:07,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:07,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:07,233 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 07:40:07,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:40:07,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368940231] [2025-01-09 07:40:07,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:07,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:40:07,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:40:07,246 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) [2025-01-09 07:40:07,262 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 [2025-01-09 07:40:07,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 07:40:07,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 07:40:07,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:07,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:07,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 07:40:07,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:40:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:07,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:40:07,888 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 07:40:07,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368940231] [2025-01-09 07:40:07,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368940231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:40:07,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:40:07,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:40:07,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939458078] [2025-01-09 07:40:07,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:40:07,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:40:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 07:40:07,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:40:07,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:40:07,922 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-01-09 07:40:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:40:08,139 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-01-09 07:40:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:40:08,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) Word has length 5 [2025-01-09 07:40:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:40:08,146 INFO L225 Difference]: With dead ends: 17 [2025-01-09 07:40:08,147 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 07:40:08,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:40:08,152 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:40:08,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:40:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 07:40:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-01-09 07:40:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2025-01-09 07:40:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 07:40:08,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 07:40:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:40:08,187 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 07:40:08,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-01-09 07:40:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 07:40:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 07:40:08,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:08,188 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:08,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 07:40:08,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:40:08,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:08,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:08,394 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 07:40:08,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:40:08,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2035846007] [2025-01-09 07:40:08,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:08,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:40:08,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:40:08,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:40:08,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 07:40:08,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 07:40:08,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 07:40:08,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:08,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:08,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-01-09 07:40:08,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:40:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:10,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 07:40:35,053 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-01-09 07:40:35,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-01-09 07:40:35,055 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 07:40:35,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035846007] [2025-01-09 07:40:35,055 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-01-09 07:40:35,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 07:40:35,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:40:35,261 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-01-09 07:40:35,266 INFO L158 Benchmark]: Toolchain (without parser) took 29094.02ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 92.0MB in the beginning and 351.4MB in the end (delta: -259.4MB). Peak memory consumption was 167.6MB. Max. memory is 16.1GB. [2025-01-09 07:40:35,266 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 61.5MB in the beginning and 61.4MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:40:35,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.85ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 75.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 07:40:35,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.71ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 72.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:40:35,267 INFO L158 Benchmark]: Boogie Preprocessor took 57.06ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 69.7MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 07:40:35,267 INFO L158 Benchmark]: RCFGBuilder took 514.65ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 44.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 07:40:35,269 INFO L158 Benchmark]: TraceAbstraction took 28104.84ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 43.9MB in the beginning and 351.4MB in the end (delta: -307.5MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB. [2025-01-09 07:40:35,272 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.17ms. Allocated memory is still 83.9MB. Free memory was 61.5MB in the beginning and 61.4MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.85ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 75.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.71ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 72.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.06ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 69.7MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 514.65ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 44.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 28104.84ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 43.9MB in the beginning and 351.4MB in the end (delta: -307.5MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")