./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb'] 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.eq_sdp_v6.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 2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:47:39,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:47:39,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 02:47:39,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:47:39,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:47:39,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:47:39,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:47:39,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:47:39,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:47:39,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:47:39,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:47:39,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:47:39,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:47:39,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:47:39,789 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:47:39,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:47:39,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:47:39,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 02:47:39,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:47:39,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:47:39,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:47:39,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:47:39,790 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:47:39,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:47:39,790 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:47:39,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:47:39,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:47:39,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:47:39,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:47:39,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:47:39,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:47:39,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:47:39,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:47:39,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 02:47:39,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 02:47:39,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:47:39,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:47:39,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:47:39,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:47:39,791 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 -> 2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb [2024-11-07 02:47:40,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:47:40,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:47:40,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:47:40,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:47:40,024 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:47:40,025 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.eq_sdp_v6.c [2024-11-07 02:47:41,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:47:41,383 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:47:41,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c [2024-11-07 02:47:41,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d327c763c/1b59037efe644195a7b473911a3cd927/FLAG92c1a0f00 [2024-11-07 02:47:41,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d327c763c/1b59037efe644195a7b473911a3cd927 [2024-11-07 02:47:41,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:47:41,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:47:41,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:47:41,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:47:41,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:47:41,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:41,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56aa130c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41, skipping insertion in model container [2024-11-07 02:47:41,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:41,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:47:41,841 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.eq_sdp_v6.c[1249,1262] [2024-11-07 02:47:41,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:47:41,913 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:47:41,920 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.eq_sdp_v6.c[1249,1262] [2024-11-07 02:47:41,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:47:41,964 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:47:41,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41 WrapperNode [2024-11-07 02:47:41,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:47:41,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:47:41,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:47:41,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:47:41,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:41,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:42,040 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 599 [2024-11-07 02:47:42,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:47:42,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:47:42,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:47:42,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:47:42,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:42,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:42,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:42,098 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 02:47:42,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:42,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:42,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:42,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:42,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:42,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:42,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:47:42,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:47:42,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:47:42,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:47:42,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (1/1) ... [2024-11-07 02:47:42,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:47:42,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:47:42,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 02:47:42,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 02:47:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:47:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 02:47:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:47:42,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:47:42,306 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:47:42,307 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:47:42,884 INFO L? ?]: Removed 260 outVars from TransFormulas that were not future-live. [2024-11-07 02:47:42,884 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:47:42,896 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:47:42,896 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:47:42,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:47:42 BoogieIcfgContainer [2024-11-07 02:47:42,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:47:42,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:47:42,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:47:42,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:47:42,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:47:41" (1/3) ... [2024-11-07 02:47:42,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8db5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:47:42, skipping insertion in model container [2024-11-07 02:47:42,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:41" (2/3) ... [2024-11-07 02:47:42,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8db5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:47:42, skipping insertion in model container [2024-11-07 02:47:42,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:47:42" (3/3) ... [2024-11-07 02:47:42,903 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v6.c [2024-11-07 02:47:42,914 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:47:42,915 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:47:42,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:47:42,969 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;@25f746c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:47:42,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:47:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:47:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 02:47:42,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:47:42,983 INFO L215 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] [2024-11-07 02:47:42,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:47:42,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:47:42,988 INFO L85 PathProgramCache]: Analyzing trace with hash 761713907, now seen corresponding path program 1 times [2024-11-07 02:47:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:47:42,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253975485] [2024-11-07 02:47:42,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:47:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:47:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:47:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:47:43,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:47:43,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253975485] [2024-11-07 02:47:43,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253975485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:47:43,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:47:43,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:47:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592616144] [2024-11-07 02:47:43,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:47:43,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:47:43,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:47:43,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:47:43,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:47:43,575 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 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 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:47:43,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:47:43,616 INFO L93 Difference]: Finished difference Result 177 states and 261 transitions. [2024-11-07 02:47:43,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:47:43,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-11-07 02:47:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:47:43,623 INFO L225 Difference]: With dead ends: 177 [2024-11-07 02:47:43,625 INFO L226 Difference]: Without dead ends: 129 [2024-11-07 02:47:43,627 INFO L431 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 [2024-11-07 02:47:43,630 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 549 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 [2024-11-07 02:47:43,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 549 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:47:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-07 02:47:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-07 02:47:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4765625) internal successors, (189), 128 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:47:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2024-11-07 02:47:43,657 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 55 [2024-11-07 02:47:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:47:43,657 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2024-11-07 02:47:43,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:47:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2024-11-07 02:47:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 02:47:43,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:47:43,659 INFO L215 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] [2024-11-07 02:47:43,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 02:47:43,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:47:43,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:47:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2139990115, now seen corresponding path program 1 times [2024-11-07 02:47:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:47:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236226394] [2024-11-07 02:47:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:47:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:47:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:47:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:47:43,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:47:43,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236226394] [2024-11-07 02:47:43,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236226394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:47:43,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:47:43,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:47:43,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692191638] [2024-11-07 02:47:43,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:47:43,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:47:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:47:43,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:47:43,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:47:43,865 INFO L87 Difference]: Start difference. First operand 129 states and 189 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:47:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:47:43,894 INFO L93 Difference]: Finished difference Result 178 states and 259 transitions. [2024-11-07 02:47:43,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:47:43,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2024-11-07 02:47:43,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:47:43,895 INFO L225 Difference]: With dead ends: 178 [2024-11-07 02:47:43,895 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 02:47:43,896 INFO L431 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 [2024-11-07 02:47:43,896 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 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 [2024-11-07 02:47:43,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:47:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 02:47:43,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-07 02:47:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4692307692307693) internal successors, (191), 130 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:47:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 191 transitions. [2024-11-07 02:47:43,903 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 191 transitions. Word has length 56 [2024-11-07 02:47:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:47:43,904 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 191 transitions. [2024-11-07 02:47:43,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:47:43,904 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 191 transitions. [2024-11-07 02:47:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 02:47:43,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:47:43,908 INFO L215 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] [2024-11-07 02:47:43,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 02:47:43,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:47:43,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:47:43,909 INFO L85 PathProgramCache]: Analyzing trace with hash 817218508, now seen corresponding path program 1 times [2024-11-07 02:47:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:47:43,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030597323] [2024-11-07 02:47:43,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:47:43,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:47:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:47:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:47:44,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:47:44,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030597323] [2024-11-07 02:47:44,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030597323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:47:44,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:47:44,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:47:44,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305261140] [2024-11-07 02:47:44,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:47:44,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:47:44,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:47:44,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:47:44,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:47:44,187 INFO L87 Difference]: Start difference. First operand 131 states and 191 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:47:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:47:44,231 INFO L93 Difference]: Finished difference Result 178 states and 258 transitions. [2024-11-07 02:47:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:47:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 57 [2024-11-07 02:47:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:47:44,232 INFO L225 Difference]: With dead ends: 178 [2024-11-07 02:47:44,232 INFO L226 Difference]: Without dead ends: 129 [2024-11-07 02:47:44,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:47:44,233 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 138 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:47:44,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 357 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:47:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-07 02:47:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-07 02:47:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4609375) internal successors, (187), 128 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:47:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 187 transitions. [2024-11-07 02:47:44,237 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 187 transitions. Word has length 57 [2024-11-07 02:47:44,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:47:44,237 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 187 transitions. [2024-11-07 02:47:44,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:47:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 187 transitions. [2024-11-07 02:47:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 02:47:44,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:47:44,239 INFO L215 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] [2024-11-07 02:47:44,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 02:47:44,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:47:44,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:47:44,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1128515398, now seen corresponding path program 1 times [2024-11-07 02:47:44,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:47:44,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890440503] [2024-11-07 02:47:44,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:47:44,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:47:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:47:44,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 02:47:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:47:44,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 02:47:44,359 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 02:47:44,360 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 02:47:44,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 02:47:44,364 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 02:47:44,405 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 02:47:44,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:47:44 BoogieIcfgContainer [2024-11-07 02:47:44,410 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 02:47:44,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 02:47:44,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 02:47:44,412 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 02:47:44,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:47:42" (3/4) ... [2024-11-07 02:47:44,414 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 02:47:44,415 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 02:47:44,416 INFO L158 Benchmark]: Toolchain (without parser) took 2694.73ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 92.1MB in the beginning and 44.8MB in the end (delta: 47.4MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2024-11-07 02:47:44,416 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:47:44,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.83ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 73.3MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:47:44,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.93ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 61.4MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:47:44,416 INFO L158 Benchmark]: Boogie Preprocessor took 116.71ms. Allocated memory is still 117.4MB. Free memory was 61.4MB in the beginning and 54.1MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:47:44,416 INFO L158 Benchmark]: RCFGBuilder took 736.47ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 54.1MB in the beginning and 70.3MB in the end (delta: -16.1MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-11-07 02:47:44,417 INFO L158 Benchmark]: TraceAbstraction took 1512.30ms. Allocated memory is still 159.4MB. Free memory was 69.8MB in the beginning and 44.8MB in the end (delta: 25.0MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-07 02:47:44,417 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 159.4MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:47:44,418 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.57ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.83ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 73.3MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.93ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 61.4MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.71ms. Allocated memory is still 117.4MB. Free memory was 61.4MB in the beginning and 54.1MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 736.47ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 54.1MB in the beginning and 70.3MB in the end (delta: -16.1MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1512.30ms. Allocated memory is still 159.4MB. Free memory was 69.8MB in the beginning and 44.8MB in the end (delta: 25.0MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 159.4MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 37.5kB). 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 155. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_22 = 0; [L34] const SORT_5 var_31 = 1; [L35] const SORT_1 var_109 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_35; [L44] SORT_5 input_37; [L45] SORT_5 input_39; [L46] SORT_5 input_51; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L48] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L49] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L50] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L51] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L52] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L53] SORT_5 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L54] SORT_5 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L55] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L56] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L57] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L58] SORT_5 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L59] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L60] SORT_5 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L61] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L62] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L63] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L64] SORT_1 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L65] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L66] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L67] SORT_1 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] SORT_1 init_11_arg_1 = var_9; [L70] state_10 = init_11_arg_1 [L71] SORT_1 init_13_arg_1 = var_9; [L72] state_12 = init_13_arg_1 [L73] SORT_1 init_19_arg_1 = var_9; [L74] state_18 = init_19_arg_1 [L75] SORT_5 init_24_arg_1 = var_22; [L76] state_23 = init_24_arg_1 [L77] SORT_1 init_27_arg_1 = var_9; [L78] state_26 = init_27_arg_1 [L79] SORT_5 init_42_arg_1 = var_22; [L80] state_41 = init_42_arg_1 [L81] SORT_5 init_44_arg_1 = var_22; [L82] state_43 = init_44_arg_1 [L83] SORT_1 init_46_arg_1 = var_9; [L84] state_45 = init_46_arg_1 [L85] SORT_1 init_48_arg_1 = var_9; [L86] state_47 = init_48_arg_1 [L87] SORT_1 init_50_arg_1 = var_9; [L88] state_49 = init_50_arg_1 [L89] SORT_5 init_54_arg_1 = var_22; [L90] state_53 = init_54_arg_1 [L91] SORT_1 init_56_arg_1 = var_9; [L92] state_55 = init_56_arg_1 [L93] SORT_5 init_58_arg_1 = var_22; [L94] state_57 = init_58_arg_1 [L95] SORT_1 init_60_arg_1 = var_9; [L96] state_59 = init_60_arg_1 [L97] SORT_1 init_63_arg_1 = var_9; [L98] state_62 = init_63_arg_1 [L99] SORT_1 init_65_arg_1 = var_9; [L100] state_64 = init_65_arg_1 [L101] SORT_1 init_67_arg_1 = var_9; [L102] state_66 = init_67_arg_1 [L103] SORT_1 init_69_arg_1 = var_9; [L104] state_68 = init_69_arg_1 [L105] SORT_1 init_71_arg_1 = var_9; [L106] state_70 = init_71_arg_1 [L107] SORT_1 init_73_arg_1 = var_9; [L108] state_72 = init_73_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L111] input_2 = __VERIFIER_nondet_uchar() [L112] input_3 = __VERIFIER_nondet_uchar() [L113] input_4 = __VERIFIER_nondet_uchar() [L114] input_6 = __VERIFIER_nondet_uchar() [L115] input_7 = __VERIFIER_nondet_uchar() [L116] input_8 = __VERIFIER_nondet_uchar() [L117] EXPR input_8 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L117] input_8 = input_8 & mask_SORT_5 [L118] input_35 = __VERIFIER_nondet_uchar() [L119] input_37 = __VERIFIER_nondet_uchar() [L120] input_39 = __VERIFIER_nondet_uchar() [L121] input_51 = __VERIFIER_nondet_uchar() [L124] SORT_1 var_16_arg_0 = state_10; [L125] SORT_5 var_16 = var_16_arg_0 >> 0; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_16=0, var_22=0, var_31=1, var_9=0] [L126] EXPR var_16 & mask_SORT_5 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L126] var_16 = var_16 & mask_SORT_5 [L127] SORT_1 var_15_arg_0 = state_10; [L128] SORT_1 var_15_arg_1 = state_12; [L129] SORT_1 var_15 = var_15_arg_0 + var_15_arg_1; [L130] SORT_1 var_14_arg_0 = state_10; [L131] SORT_1 var_14_arg_1 = state_12; [L132] SORT_1 var_14 = var_14_arg_0 - var_14_arg_1; [L133] SORT_5 var_17_arg_0 = var_16; [L134] SORT_1 var_17_arg_1 = var_15; [L135] SORT_1 var_17_arg_2 = var_14; [L136] SORT_1 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L137] SORT_1 var_21_arg_0 = var_17; [L138] SORT_1 var_21_arg_1 = state_18; [L139] SORT_1 var_21 = var_21_arg_0 + var_21_arg_1; [L140] SORT_1 var_20_arg_0 = var_17; [L141] SORT_1 var_20_arg_1 = state_18; [L142] SORT_1 var_20 = var_20_arg_0 - var_20_arg_1; [L143] SORT_5 var_25_arg_0 = state_23; [L144] SORT_1 var_25_arg_1 = var_21; [L145] SORT_1 var_25_arg_2 = var_20; [L146] SORT_1 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_25=0, var_31=1, var_9=0] [L147] EXPR var_25 & mask_SORT_1 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L147] var_25 = var_25 & mask_SORT_1 [L148] SORT_1 var_28_arg_0 = var_25; [L149] SORT_1 var_28_arg_1 = state_26; [L150] SORT_5 var_28 = var_28_arg_0 == var_28_arg_1; [L151] SORT_5 var_32_arg_0 = var_28; [L152] SORT_5 var_32 = ~var_32_arg_0; [L153] SORT_5 var_33_arg_0 = var_31; [L154] SORT_5 var_33_arg_1 = var_32; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-2, var_9=0] [L155] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L155] SORT_5 var_33 = var_33_arg_0 & var_33_arg_1; [L156] EXPR var_33 & mask_SORT_5 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L156] var_33 = var_33 & mask_SORT_5 [L157] SORT_5 bad_34_arg_0 = var_33; [L158] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 130 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 1451 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 902 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 549 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 02:47:44,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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.eq_sdp_v6.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 2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:47:46,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:47:46,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 02:47:46,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:47:46,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:47:46,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:47:46,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:47:46,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:47:46,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:47:46,402 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:47:46,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:47:46,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:47:46,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:47:46,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:47:46,403 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:47:46,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:47:46,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:47:46,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:47:46,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:47:46,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:47:46,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:47:46,403 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 02:47:46,403 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 02:47:46,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:47:46,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:47:46,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:47:46,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:47:46,404 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 -> 2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb [2024-11-07 02:47:46,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:47:46,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:47:46,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:47:46,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:47:46,713 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:47:46,714 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.eq_sdp_v6.c [2024-11-07 02:47:47,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:47:48,031 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:47:48,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c [2024-11-07 02:47:48,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9bcf196a7/69fb67d22fa8432f982f4d7038c9857e/FLAGce3ed911b [2024-11-07 02:47:48,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9bcf196a7/69fb67d22fa8432f982f4d7038c9857e [2024-11-07 02:47:48,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:47:48,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:47:48,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:47:48,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:47:48,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:47:48,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c9eedb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48, skipping insertion in model container [2024-11-07 02:47:48,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:47:48,541 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.eq_sdp_v6.c[1249,1262] [2024-11-07 02:47:48,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:47:48,635 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:47:48,644 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.eq_sdp_v6.c[1249,1262] [2024-11-07 02:47:48,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:47:48,695 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:47:48,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48 WrapperNode [2024-11-07 02:47:48,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:47:48,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:47:48,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:47:48,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:47:48,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,751 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 359 [2024-11-07 02:47:48,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:47:48,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:47:48,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:47:48,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:47:48,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,783 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 02:47:48,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:47:48,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:47:48,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:47:48,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:47:48,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (1/1) ... [2024-11-07 02:47:48,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:47:48,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:47:48,841 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 02:47:48,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 02:47:48,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:47:48,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 02:47:48,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:47:48,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:47:48,978 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:47:48,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:47:49,264 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-11-07 02:47:49,265 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:47:49,274 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:47:49,274 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:47:49,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:47:49 BoogieIcfgContainer [2024-11-07 02:47:49,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:47:49,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:47:49,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:47:49,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:47:49,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:47:48" (1/3) ... [2024-11-07 02:47:49,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1125f535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:47:49, skipping insertion in model container [2024-11-07 02:47:49,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:47:48" (2/3) ... [2024-11-07 02:47:49,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1125f535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:47:49, skipping insertion in model container [2024-11-07 02:47:49,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:47:49" (3/3) ... [2024-11-07 02:47:49,283 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v6.c [2024-11-07 02:47:49,294 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:47:49,294 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:47:49,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:47:49,336 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;@195d6548, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:47:49,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:47:49,340 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) [2024-11-07 02:47:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 02:47:49,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:47:49,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 02:47:49,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:47:49,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:47:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 02:47:49,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:47:49,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361554295] [2024-11-07 02:47:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:47:49,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:47:49,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:47:49,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:47:49,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 02:47:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:47:49,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 02:47:49,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:47:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:47:49,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 02:47:49,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:47:49,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361554295] [2024-11-07 02:47:49,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361554295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:47:49,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:47:49,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:47:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699796478] [2024-11-07 02:47:49,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:47:49,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:47:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:47:49,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:47:49,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:47:49,836 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) [2024-11-07 02:47:49,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:47:49,872 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-07 02:47:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:47:49,874 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 [2024-11-07 02:47:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:47:49,878 INFO L225 Difference]: With dead ends: 17 [2024-11-07 02:47:49,878 INFO L226 Difference]: Without dead ends: 9 [2024-11-07 02:47:49,880 INFO L431 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 [2024-11-07 02:47:49,884 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:47:49,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:47:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-07 02:47:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-07 02:47:49,901 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) [2024-11-07 02:47:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 02:47:49,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 02:47:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:47:49,905 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 02:47:49,905 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) [2024-11-07 02:47:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 02:47:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 02:47:49,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:47:49,905 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 02:47:49,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 02:47:50,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:47:50,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:47:50,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:47:50,107 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 02:47:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:47:50,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855973693] [2024-11-07 02:47:50,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:47:50,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:47:50,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:47:50,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:47:50,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 02:47:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:47:50,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-07 02:47:50,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:47:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:47:50,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:47:59,156 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse44 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_64~0#1|)))) (.cse39 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_22~0#1|))) .cse44)))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_9~0#1|))))) (let ((.cse9 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse44 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_43~0#1|))))))) (.cse40 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse32)) .cse44)) (_ bv0 8))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_10|)))) .cse44)) (_ bv0 8)))) (.cse38 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse46)))))))) (.cse37 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse45 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse45))))))) (.cse31 (not .cse39)) (.cse36 (bvneg .cse32)) (.cse7 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_10|)))) .cse44))))) (.cse17 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse44 ((_ zero_extend 24) ((_ extract 7 0) .cse43)))))) (.cse15 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_72~0#1|)))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse43 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_68~0#1|))))))))))))))) (.cse1 (not .cse17)) (.cse12 (or .cse40 (and (or .cse2 (and (or .cse38 .cse39) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse41 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|)))))))) .cse41))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse41))))))) .cse31))) (or (and (or .cse37 .cse39) (or .cse31 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse42 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|)))))))) .cse42))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse42)))))))) .cse7)))) (.cse13 (or (and (or .cse31 (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 .cse32))))) .cse36))))))) (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse33 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse33))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse34 .cse33)))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse35 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse35))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse34 .cse35)))))) .cse7)))) (or (and (or .cse7 .cse37) (or .cse2 .cse38)) .cse39)) (not .cse40))) (.cse8 (not .cse9)) (.cse21 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_59~0#1|)) (.cse20 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_55~0#1|)) (.cse0 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_57~0#1|))) (and (or .cse0 (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse21))))))))) (let ((.cse11 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))))))) (.cse10 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse18 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))))))))) (and (or .cse1 (and (or (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse4)))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse6))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse6)))))) .cse7)) .cse8) (or .cse9 (and (or .cse2 .cse10) (or .cse11 .cse7))))) .cse12 .cse13 (or (and (or (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse14 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|)))))))))))))) .cse8) (or .cse9 .cse11)) .cse7) (or (and (or .cse9 .cse10) (or .cse8 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse16))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|))))))))))))))))) .cse2)) .cse17))))) (or (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse21 (bvneg .cse20)))))))))) (let ((.cse26 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse30)))))))) (.cse25 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse29 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse29)))))))) (and (or (and (or (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse23)))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse24)))))) .cse7)) .cse8) (or (and (or .cse7 .cse25) (or .cse2 .cse26)) .cse9)) .cse1) .cse12 .cse13 (or (and (or .cse2 (and (or .cse9 .cse26) (or .cse8 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse27)))))))))) (or .cse7 (and (or .cse9 .cse25) (or .cse8 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse28)))))))))) .cse17)))) (not .cse0))))))) is different from false [2024-11-07 02:48:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-07 02:48:05,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:48:05,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855973693] [2024-11-07 02:48:05,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855973693] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 02:48:05,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 02:48:05,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 02:48:05,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092462267] [2024-11-07 02:48:05,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 02:48:05,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:48:05,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:48:05,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:48:05,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2024-11-07 02:48:05,176 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:48:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:48:06,586 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-07 02:48:06,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 02:48:06,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 8 [2024-11-07 02:48:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:48:06,587 INFO L225 Difference]: With dead ends: 14 [2024-11-07 02:48:06,587 INFO L226 Difference]: Without dead ends: 12 [2024-11-07 02:48:06,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2024-11-07 02:48:06,588 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 02:48:06,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 5 Unchecked, 0.4s Time] [2024-11-07 02:48:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-07 02:48:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-07 02:48:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:48:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-07 02:48:06,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-07 02:48:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:48:06,590 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-07 02:48:06,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:48:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-07 02:48:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 02:48:06,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:48:06,591 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-07 02:48:06,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 02:48:06,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:48:06,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:48:06,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:48:06,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-07 02:48:06,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:48:06,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624062362] [2024-11-07 02:48:06,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 02:48:06,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:48:06,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:48:06,794 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:48:06,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 02:48:06,937 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 02:48:06,937 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 02:48:06,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-07 02:48:06,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:48:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:48:12,074 INFO L311 TraceCheckSpWp]: Computing backward predicates...