./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.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.mul5.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', '8d05a766c76ac0298c0a80f704d02f1cc9846c5882f0c27837b6bbd7c98f7d2d'] 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.mul5.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 8d05a766c76ac0298c0a80f704d02f1cc9846c5882f0c27837b6bbd7c98f7d2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:13:25,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:13:25,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 03:13:25,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:13:25,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:13:25,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:13:25,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:13:25,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:13:25,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:13:25,967 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:13:25,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:13:25,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:13:25,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:13:25,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:13:25,969 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:13:25,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:13:25,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:13:25,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:13:25,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:13:25,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:13:25,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:13:25,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:13:25,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:13:25,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:13:25,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:13:25,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:13:25,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:13:25,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:13:25,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:13:25,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:25,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:13:25,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:13:25,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:13:25,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:13:25,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:13:25,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:13:25,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:13:25,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:13:25,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:13:25,971 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 -> 8d05a766c76ac0298c0a80f704d02f1cc9846c5882f0c27837b6bbd7c98f7d2d [2024-11-07 03:13:26,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:13:26,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:13:26,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:13:26,233 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:13:26,233 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:13:26,234 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.mul5.c [2024-11-07 03:13:27,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:13:27,788 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:13:27,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c [2024-11-07 03:13:27,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de58083c7/a98ee97929b74359942085d9eff84216/FLAG1b7a0e9a3 [2024-11-07 03:13:27,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de58083c7/a98ee97929b74359942085d9eff84216 [2024-11-07 03:13:27,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:13:27,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:13:27,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:27,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:13:27,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:13:27,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5067e890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27, skipping insertion in model container [2024-11-07 03:13:27,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:13:27,959 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.mul5.c[1244,1257] [2024-11-07 03:13:28,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:28,059 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:13:28,071 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.mul5.c[1244,1257] [2024-11-07 03:13:28,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:28,147 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:13:28,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28 WrapperNode [2024-11-07 03:13:28,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:28,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:28,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:13:28,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:13:28,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (1/1) ... [2024-11-07 03:13:28,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (1/1) ... [2024-11-07 03:13:28,247 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 517 [2024-11-07 03:13:28,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:28,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:13:28,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:13:28,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:13:28,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (1/1) ... [2024-11-07 03:13:28,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (1/1) ... [2024-11-07 03:13:28,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (1/1) ... [2024-11-07 03:13:28,304 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-07 03:13:28,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (1/1) ... [2024-11-07 03:13:28,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (1/1) ... [2024-11-07 03:13:28,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (1/1) ... [2024-11-07 03:13:28,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (1/1) ... [2024-11-07 03:13:28,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (1/1) ... [2024-11-07 03:13:28,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (1/1) ... [2024-11-07 03:13:28,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:13:28,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:13:28,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:13:28,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:13:28,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (1/1) ... [2024-11-07 03:13:28,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:28,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:13:28,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 03:13:28,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 03:13:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:13:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:13:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 03:13:28,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:13:28,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:13:28,545 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:13:28,547 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:13:29,289 INFO L? ?]: Removed 210 outVars from TransFormulas that were not future-live. [2024-11-07 03:13:29,289 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:13:29,301 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:13:29,302 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:13:29,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:29 BoogieIcfgContainer [2024-11-07 03:13:29,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:13:29,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:13:29,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:13:29,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:13:29,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:13:27" (1/3) ... [2024-11-07 03:13:29,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b421f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:29, skipping insertion in model container [2024-11-07 03:13:29,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:28" (2/3) ... [2024-11-07 03:13:29,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b421f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:29, skipping insertion in model container [2024-11-07 03:13:29,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:29" (3/3) ... [2024-11-07 03:13:29,312 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul5.c [2024-11-07 03:13:29,326 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:13:29,326 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:13:29,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:13:29,389 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;@4901d4e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:13:29,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:13:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 132 states have (on average 1.4924242424242424) internal successors, (197), 133 states have internal predecessors, (197), 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 03:13:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 03:13:29,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:29,403 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] [2024-11-07 03:13:29,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:29,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1749147305, now seen corresponding path program 1 times [2024-11-07 03:13:29,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:29,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526012385] [2024-11-07 03:13:29,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:29,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:30,190 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 03:13:30,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:30,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526012385] [2024-11-07 03:13:30,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526012385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:30,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:30,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:13:30,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687072589] [2024-11-07 03:13:30,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:30,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:13:30,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:30,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:13:30,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:30,218 INFO L87 Difference]: Start difference. First operand has 134 states, 132 states have (on average 1.4924242424242424) internal successors, (197), 133 states have internal predecessors, (197), 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 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 03:13:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:30,268 INFO L93 Difference]: Finished difference Result 225 states and 333 transitions. [2024-11-07 03:13:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:30,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2024-11-07 03:13:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:30,276 INFO L225 Difference]: With dead ends: 225 [2024-11-07 03:13:30,277 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 03:13:30,279 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 03:13:30,283 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 567 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 03:13:30,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 567 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 03:13:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-07 03:13:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 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 03:13:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 195 transitions. [2024-11-07 03:13:30,313 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 195 transitions. Word has length 39 [2024-11-07 03:13:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:30,314 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 195 transitions. [2024-11-07 03:13:30,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 03:13:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 195 transitions. [2024-11-07 03:13:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 03:13:30,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:30,315 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] [2024-11-07 03:13:30,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:13:30,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:30,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:30,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1609313019, now seen corresponding path program 1 times [2024-11-07 03:13:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:30,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543975519] [2024-11-07 03:13:30,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:30,537 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 03:13:30,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:30,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543975519] [2024-11-07 03:13:30,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543975519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:30,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:30,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:13:30,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415567142] [2024-11-07 03:13:30,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:30,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:13:30,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:30,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:13:30,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:30,541 INFO L87 Difference]: Start difference. First operand 133 states and 195 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 03:13:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:30,585 INFO L93 Difference]: Finished difference Result 226 states and 331 transitions. [2024-11-07 03:13:30,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:30,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-11-07 03:13:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:30,586 INFO L225 Difference]: With dead ends: 226 [2024-11-07 03:13:30,587 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 03:13:30,587 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 03:13:30,588 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 563 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 03:13:30,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 563 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 03:13:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-07 03:13:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.4701492537313432) internal successors, (197), 134 states have internal predecessors, (197), 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 03:13:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 197 transitions. [2024-11-07 03:13:30,605 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 197 transitions. Word has length 40 [2024-11-07 03:13:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:30,606 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 197 transitions. [2024-11-07 03:13:30,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 03:13:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 197 transitions. [2024-11-07 03:13:30,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 03:13:30,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:30,607 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] [2024-11-07 03:13:30,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:13:30,607 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:30,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash 552938242, now seen corresponding path program 1 times [2024-11-07 03:13:30,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:30,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638888865] [2024-11-07 03:13:30,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:30,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:31,030 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 03:13:31,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:31,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638888865] [2024-11-07 03:13:31,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638888865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:31,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:31,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:13:31,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177817582] [2024-11-07 03:13:31,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:31,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:13:31,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:31,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:13:31,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:13:31,034 INFO L87 Difference]: Start difference. First operand 135 states and 197 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 03:13:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:31,113 INFO L93 Difference]: Finished difference Result 265 states and 383 transitions. [2024-11-07 03:13:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:13:31,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 41 [2024-11-07 03:13:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:31,115 INFO L225 Difference]: With dead ends: 265 [2024-11-07 03:13:31,117 INFO L226 Difference]: Without dead ends: 172 [2024-11-07 03:13:31,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:13:31,119 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 79 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:31,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 683 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-07 03:13:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 153. [2024-11-07 03:13:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 152 states have internal predecessors, (223), 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 03:13:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2024-11-07 03:13:31,139 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 41 [2024-11-07 03:13:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:31,139 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2024-11-07 03:13:31,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 03:13:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2024-11-07 03:13:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 03:13:31,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:31,140 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] [2024-11-07 03:13:31,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:13:31,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:31,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:31,141 INFO L85 PathProgramCache]: Analyzing trace with hash 870103340, now seen corresponding path program 1 times [2024-11-07 03:13:31,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312250776] [2024-11-07 03:13:31,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:31,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:31,484 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 03:13:31,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:31,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312250776] [2024-11-07 03:13:31,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312250776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:31,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:31,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:13:31,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180006496] [2024-11-07 03:13:31,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:31,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:13:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:31,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:13:31,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:13:31,488 INFO L87 Difference]: Start difference. First operand 153 states and 223 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 03:13:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:31,590 INFO L93 Difference]: Finished difference Result 267 states and 385 transitions. [2024-11-07 03:13:31,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:13:31,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 42 [2024-11-07 03:13:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:31,592 INFO L225 Difference]: With dead ends: 267 [2024-11-07 03:13:31,592 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 03:13:31,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:13:31,593 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 80 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:31,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1042 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:13:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 03:13:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 156. [2024-11-07 03:13:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4645161290322581) internal successors, (227), 155 states have internal predecessors, (227), 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 03:13:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 227 transitions. [2024-11-07 03:13:31,604 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 227 transitions. Word has length 42 [2024-11-07 03:13:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:31,604 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 227 transitions. [2024-11-07 03:13:31,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 03:13:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 227 transitions. [2024-11-07 03:13:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-07 03:13:31,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:31,605 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] [2024-11-07 03:13:31,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:13:31,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:31,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:31,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1522746271, now seen corresponding path program 1 times [2024-11-07 03:13:31,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:31,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358850240] [2024-11-07 03:13:31,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:31,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:32,117 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 03:13:32,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:32,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358850240] [2024-11-07 03:13:32,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358850240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:32,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:32,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 03:13:32,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739084257] [2024-11-07 03:13:32,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:32,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 03:13:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:32,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 03:13:32,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:13:32,123 INFO L87 Difference]: Start difference. First operand 156 states and 227 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 03:13:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:32,291 INFO L93 Difference]: Finished difference Result 267 states and 384 transitions. [2024-11-07 03:13:32,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:13:32,292 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 43 [2024-11-07 03:13:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:32,293 INFO L225 Difference]: With dead ends: 267 [2024-11-07 03:13:32,293 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 03:13:32,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-07 03:13:32,294 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 77 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:32,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1200 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:13:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 03:13:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2024-11-07 03:13:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.4591194968553458) internal successors, (232), 159 states have internal predecessors, (232), 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 03:13:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions. [2024-11-07 03:13:32,302 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 43 [2024-11-07 03:13:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:32,302 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 232 transitions. [2024-11-07 03:13:32,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 03:13:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions. [2024-11-07 03:13:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 03:13:32,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:32,304 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] [2024-11-07 03:13:32,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:13:32,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:32,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:32,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1525039467, now seen corresponding path program 1 times [2024-11-07 03:13:32,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:32,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253878739] [2024-11-07 03:13:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:13:32,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:13:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:13:32,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:13:32,409 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:13:32,410 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:13:32,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 03:13:32,415 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 03:13:32,468 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:13:32,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:13:32 BoogieIcfgContainer [2024-11-07 03:13:32,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:13:32,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:13:32,476 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:13:32,476 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:13:32,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:29" (3/4) ... [2024-11-07 03:13:32,479 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:13:32,479 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:13:32,480 INFO L158 Benchmark]: Toolchain (without parser) took 4666.12ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 91.3MB in the beginning and 134.6MB in the end (delta: -43.4MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2024-11-07 03:13:32,481 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:13:32,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.81ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 74.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:13:32,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.93ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 67.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:13:32,481 INFO L158 Benchmark]: Boogie Preprocessor took 89.74ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 62.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:13:32,483 INFO L158 Benchmark]: RCFGBuilder took 963.90ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 52.6MB in the end (delta: 9.9MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2024-11-07 03:13:32,483 INFO L158 Benchmark]: TraceAbstraction took 3170.38ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 52.2MB in the beginning and 134.7MB in the end (delta: -82.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:13:32,484 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 201.3MB. Free memory was 134.7MB in the beginning and 134.6MB in the end (delta: 33.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:13:32,485 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.72ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.81ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 74.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.93ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 67.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.74ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 62.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 963.90ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 52.6MB in the end (delta: 9.9MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3170.38ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 52.2MB in the beginning and 134.7MB in the end (delta: -82.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 201.3MB. Free memory was 134.7MB in the beginning and 134.6MB in the end (delta: 33.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 bitwiseOr at line 107, overapproximation of bitwiseAnd at line 112. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_1 var_10 = 0; [L39] const SORT_14 var_15 = 0; [L40] const SORT_1 var_24 = 1; [L41] const SORT_5 var_28 = 0; [L42] const SORT_8 var_35 = 0; [L43] const SORT_5 var_57 = 1; [L44] const SORT_5 var_61 = 1000; [L45] const SORT_5 var_63 = 3735928559; [L46] const SORT_5 var_66 = 12245771; [L48] SORT_1 input_2; [L49] SORT_1 input_3; [L50] SORT_1 input_4; [L51] SORT_5 input_6; [L52] SORT_5 input_7; [L53] SORT_8 input_9; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L55] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L56] SORT_14 state_16 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L57] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L57] SORT_14 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L58] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L58] SORT_5 state_29 = __VERIFIER_nondet_uint() & mask_SORT_5; [L59] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L59] SORT_5 state_31 = __VERIFIER_nondet_uint() & mask_SORT_5; [L60] EXPR __VERIFIER_nondet_ushort() & mask_SORT_8 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L60] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L61] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L62] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L63] SORT_5 state_42 = __VERIFIER_nondet_uint() & mask_SORT_5; [L64] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L64] SORT_5 state_44 = __VERIFIER_nondet_uint() & mask_SORT_5; [L66] SORT_1 init_12_arg_1 = var_10; [L67] state_11 = init_12_arg_1 [L68] SORT_14 init_17_arg_1 = var_15; [L69] state_16 = init_17_arg_1 [L70] SORT_14 init_19_arg_1 = var_15; [L71] state_18 = init_19_arg_1 [L72] SORT_5 init_30_arg_1 = var_28; [L73] state_29 = init_30_arg_1 [L74] SORT_5 init_32_arg_1 = var_28; [L75] state_31 = init_32_arg_1 [L76] SORT_8 init_37_arg_1 = var_35; [L77] state_36 = init_37_arg_1 [L78] SORT_1 init_39_arg_1 = var_24; [L79] state_38 = init_39_arg_1 [L80] SORT_1 init_41_arg_1 = var_24; [L81] state_40 = init_41_arg_1 [L82] SORT_5 init_43_arg_1 = var_28; [L83] state_42 = init_43_arg_1 [L84] SORT_5 init_45_arg_1 = var_28; [L85] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] EXPR input_6 & mask_SORT_5 VAL [input_3=0, input_4=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] EXPR input_7 & mask_SORT_5 VAL [input_3=0, input_4=0, input_6=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-1, var_21_arg_1=1, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L107] EXPR var_21_arg_0 | var_21_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L112] EXPR var_26_arg_0 & var_26_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] EXPR var_26 & mask_SORT_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 134 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 4055 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3121 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 934 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 03:13:32,517 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.mul5.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 8d05a766c76ac0298c0a80f704d02f1cc9846c5882f0c27837b6bbd7c98f7d2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:13:34,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:13:34,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 03:13:34,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:13:34,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:13:34,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:13:34,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:13:34,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:13:34,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:13:34,803 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:13:34,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:13:34,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:13:34,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:13:34,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:13:34,805 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:13:34,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:13:34,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:13:34,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:13:34,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:13:34,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:13:34,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:13:34,805 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:13:34,805 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:13:34,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:13:34,806 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:13:34,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:13:34,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:13:34,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:13:34,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:13:34,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:13:34,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:13:34,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:34,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:13:34,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:13:34,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:13:34,807 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:13:34,808 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:13:34,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:13:34,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:13:34,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:13:34,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:13:34,808 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 -> 8d05a766c76ac0298c0a80f704d02f1cc9846c5882f0c27837b6bbd7c98f7d2d [2024-11-07 03:13:35,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:13:35,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:13:35,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:13:35,120 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:13:35,121 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:13:35,122 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.mul5.c [2024-11-07 03:13:36,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:13:36,651 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:13:36,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul5.c [2024-11-07 03:13:36,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/319e0c0fc/42eb622532ed431399e8a2a8fc5fafce/FLAG4f52872cc [2024-11-07 03:13:36,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/319e0c0fc/42eb622532ed431399e8a2a8fc5fafce [2024-11-07 03:13:36,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:13:36,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:13:36,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:36,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:13:36,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:13:36,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:36,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abfa38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36, skipping insertion in model container [2024-11-07 03:13:36,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:36,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:13:36,844 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.mul5.c[1244,1257] [2024-11-07 03:13:36,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:36,915 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:13:36,928 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.mul5.c[1244,1257] [2024-11-07 03:13:36,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:36,988 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:13:36,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36 WrapperNode [2024-11-07 03:13:36,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:36,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:36,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:13:36,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:13:36,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:37,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:37,030 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 269 [2024-11-07 03:13:37,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:37,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:13:37,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:13:37,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:13:37,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:37,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:37,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:37,058 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-07 03:13:37,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:37,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:37,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:37,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:37,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:37,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:37,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:13:37,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:13:37,075 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:13:37,075 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:13:37,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:37,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:37,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:13:37,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 03:13:37,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 03:13:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:13:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:13:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 03:13:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:13:37,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:13:37,266 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:13:37,268 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:13:37,714 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-07 03:13:37,714 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:13:37,721 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:13:37,722 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:13:37,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:37 BoogieIcfgContainer [2024-11-07 03:13:37,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:13:37,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:13:37,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:13:37,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:13:37,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:13:36" (1/3) ... [2024-11-07 03:13:37,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2258e0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:37, skipping insertion in model container [2024-11-07 03:13:37,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36" (2/3) ... [2024-11-07 03:13:37,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2258e0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:37, skipping insertion in model container [2024-11-07 03:13:37,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:37" (3/3) ... [2024-11-07 03:13:37,732 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul5.c [2024-11-07 03:13:37,747 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:13:37,748 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:13:37,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:13:37,807 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;@6efd7673, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:13:37,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:13:37,812 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 03:13:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 03:13:37,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:37,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 03:13:37,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:37,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:37,826 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 03:13:37,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:13:37,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612068775] [2024-11-07 03:13:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:37,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:13:37,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:13:37,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:13:37,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 03:13:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:37,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 03:13:38,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:13:38,227 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 03:13:38,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:13:38,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:13:38,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612068775] [2024-11-07 03:13:38,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612068775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:38,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:38,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:13:38,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875137744] [2024-11-07 03:13:38,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:38,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:13:38,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:13:38,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:13:38,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:38,258 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 03:13:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:38,449 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-07 03:13:38,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:38,451 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 03:13:38,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:38,456 INFO L225 Difference]: With dead ends: 17 [2024-11-07 03:13:38,456 INFO L226 Difference]: Without dead ends: 9 [2024-11-07 03:13:38,458 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 03:13:38,460 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:38,460 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.2s Time] [2024-11-07 03:13:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-07 03:13:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-07 03:13:38,477 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 03:13:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 03:13:38,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 03:13:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:38,481 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 03:13:38,481 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 03:13:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 03:13:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 03:13:38,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:38,482 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 03:13:38,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 03:13:38,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:13:38,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:38,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 03:13:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:13:38,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688978779] [2024-11-07 03:13:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:38,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:13:38,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:13:38,689 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:13:38,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 03:13:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:38,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 03:13:38,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:13:39,304 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 03:13:39,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:13:44,702 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 03:13:44,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:13:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688978779] [2024-11-07 03:13:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688978779] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:13:44,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:13:44,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 03:13:44,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599524657] [2024-11-07 03:13:44,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:13:44,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 03:13:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:13:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 03:13:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:13:44,705 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 03:13:45,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:45,094 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-07 03:13:45,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:13:45,095 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 03:13:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:45,095 INFO L225 Difference]: With dead ends: 14 [2024-11-07 03:13:45,095 INFO L226 Difference]: Without dead ends: 12 [2024-11-07 03:13:45,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:13:45,096 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:45,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:13:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-07 03:13:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-07 03:13:45,098 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 03:13:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-07 03:13:45,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-07 03:13:45,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:45,099 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-07 03:13:45,099 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 03:13:45,099 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-07 03:13:45,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 03:13:45,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:45,099 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-07 03:13:45,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 03:13:45,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:13:45,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:45,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-07 03:13:45,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:13:45,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082947159] [2024-11-07 03:13:45,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 03:13:45,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:13:45,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:13:45,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:13:45,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 03:13:45,650 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 03:13:45,650 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 03:13:45,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:13:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:13:46,002 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 03:13:46,002 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:13:46,005 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:13:46,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-07 03:13:46,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:13:46,211 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-07 03:13:46,270 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:13:46,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:13:46 BoogieIcfgContainer [2024-11-07 03:13:46,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:13:46,276 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:13:46,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:13:46,278 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:13:46,279 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:37" (3/4) ... [2024-11-07 03:13:46,280 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 03:13:46,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 03:13:46,356 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:13:46,357 INFO L158 Benchmark]: Toolchain (without parser) took 9674.34ms. Allocated memory was 83.9MB in the beginning and 251.7MB in the end (delta: 167.8MB). Free memory was 60.0MB in the beginning and 152.2MB in the end (delta: -92.2MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. [2024-11-07 03:13:46,357 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:13:46,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.22ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 44.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:13:46,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.51ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 41.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:13:46,358 INFO L158 Benchmark]: Boogie Preprocessor took 43.49ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 38.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:13:46,358 INFO L158 Benchmark]: RCFGBuilder took 647.22ms. Allocated memory is still 83.9MB. Free memory was 38.9MB in the beginning and 50.2MB in the end (delta: -11.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-07 03:13:46,359 INFO L158 Benchmark]: TraceAbstraction took 8549.87ms. Allocated memory was 83.9MB in the beginning and 251.7MB in the end (delta: 167.8MB). Free memory was 49.6MB in the beginning and 159.5MB in the end (delta: -109.9MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2024-11-07 03:13:46,359 INFO L158 Benchmark]: Witness Printer took 80.75ms. Allocated memory is still 251.7MB. Free memory was 159.5MB in the beginning and 152.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:13:46,362 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.28ms. Allocated memory is still 83.9MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.22ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 44.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.51ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 41.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.49ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 38.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 647.22ms. Allocated memory is still 83.9MB. Free memory was 38.9MB in the beginning and 50.2MB in the end (delta: -11.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8549.87ms. Allocated memory was 83.9MB in the beginning and 251.7MB in the end (delta: 167.8MB). Free memory was 49.6MB in the beginning and 159.5MB in the end (delta: -109.9MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * Witness Printer took 80.75ms. Allocated memory is still 251.7MB. Free memory was 159.5MB in the beginning and 152.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_1 var_10 = 0; [L39] const SORT_14 var_15 = 0; [L40] const SORT_1 var_24 = 1; [L41] const SORT_5 var_28 = 0; [L42] const SORT_8 var_35 = 0; [L43] const SORT_5 var_57 = 1; [L44] const SORT_5 var_61 = 1000; [L45] const SORT_5 var_63 = 3735928559; [L46] const SORT_5 var_66 = 12245771; [L48] SORT_1 input_2; [L49] SORT_1 input_3; [L50] SORT_1 input_4; [L51] SORT_5 input_6; [L52] SORT_5 input_7; [L53] SORT_8 input_9; [L55] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] SORT_14 state_16 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L57] SORT_14 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L58] SORT_5 state_29 = __VERIFIER_nondet_uint() & mask_SORT_5; [L59] SORT_5 state_31 = __VERIFIER_nondet_uint() & mask_SORT_5; [L60] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L61] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] SORT_5 state_42 = __VERIFIER_nondet_uint() & mask_SORT_5; [L64] SORT_5 state_44 = __VERIFIER_nondet_uint() & mask_SORT_5; [L66] SORT_1 init_12_arg_1 = var_10; [L67] state_11 = init_12_arg_1 [L68] SORT_14 init_17_arg_1 = var_15; [L69] state_16 = init_17_arg_1 [L70] SORT_14 init_19_arg_1 = var_15; [L71] state_18 = init_19_arg_1 [L72] SORT_5 init_30_arg_1 = var_28; [L73] state_29 = init_30_arg_1 [L74] SORT_5 init_32_arg_1 = var_28; [L75] state_31 = init_32_arg_1 [L76] SORT_8 init_37_arg_1 = var_35; [L77] state_36 = init_37_arg_1 [L78] SORT_1 init_39_arg_1 = var_24; [L79] state_38 = init_39_arg_1 [L80] SORT_1 init_41_arg_1 = var_24; [L81] state_40 = init_41_arg_1 [L82] SORT_5 init_43_arg_1 = var_28; [L83] state_42 = init_43_arg_1 [L84] SORT_5 init_45_arg_1 = var_28; [L85] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=-559038737, var_66=12245771] [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND FALSE !(!(cond)) [L115] RET __VERIFIER_assert(!(bad_27_arg_0)) [L117] SORT_1 next_51_arg_1 = var_24; [L118] SORT_1 var_33_arg_0 = state_11; [L119] SORT_1 var_33 = ~var_33_arg_0; [L120] var_33 = var_33 & mask_SORT_1 [L121] SORT_5 var_52_arg_0 = state_29; [L122] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L123] SORT_14 var_52 = var_52_arg_0; [L124] SORT_5 var_53_arg_0 = state_31; [L125] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L126] SORT_14 var_53 = var_53_arg_0; [L127] SORT_14 var_54_arg_0 = var_52; [L128] SORT_14 var_54_arg_1 = var_53; [L129] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L130] SORT_1 var_55_arg_0 = var_33; [L131] SORT_14 var_55_arg_1 = var_15; [L132] SORT_14 var_55_arg_2 = var_54; [L133] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L134] var_55 = var_55 & mask_SORT_14 [L135] SORT_14 next_56_arg_1 = var_55; [L136] SORT_1 var_70_arg_0 = state_38; [L137] SORT_1 var_70_arg_1 = state_40; [L138] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L139] var_70 = var_70 & mask_SORT_1 [L140] SORT_8 var_60_arg_0 = state_36; [L141] var_60_arg_0 = var_60_arg_0 & mask_SORT_8 [L142] SORT_5 var_60 = var_60_arg_0; [L143] SORT_5 var_62_arg_0 = var_60; [L144] SORT_5 var_62_arg_1 = var_61; [L145] SORT_1 var_62 = var_62_arg_0 > var_62_arg_1; [L146] SORT_5 var_64_arg_0 = input_6; [L147] SORT_5 var_64_arg_1 = var_63; [L148] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L149] SORT_1 var_65_arg_0 = var_62; [L150] SORT_1 var_65_arg_1 = var_64; [L151] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L152] SORT_5 var_67_arg_0 = input_7; [L153] SORT_5 var_67_arg_1 = var_66; [L154] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L155] SORT_1 var_68_arg_0 = var_65; [L156] SORT_1 var_68_arg_1 = var_67; [L157] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L158] var_68 = var_68 & mask_SORT_1 [L159] SORT_5 var_46_arg_0 = state_42; [L160] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L161] SORT_14 var_46 = var_46_arg_0; [L162] SORT_5 var_47_arg_0 = state_44; [L163] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L164] SORT_14 var_47 = var_47_arg_0; [L165] SORT_14 var_48_arg_0 = var_46; [L166] SORT_14 var_48_arg_1 = var_47; [L167] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L168] SORT_5 var_58_arg_0 = var_57; [L169] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L170] SORT_14 var_58 = var_58_arg_0; [L171] SORT_14 var_59_arg_0 = var_48; [L172] SORT_14 var_59_arg_1 = var_58; [L173] SORT_14 var_59 = var_59_arg_0 + var_59_arg_1; [L174] SORT_1 var_69_arg_0 = var_68; [L175] SORT_14 var_69_arg_1 = var_59; [L176] SORT_14 var_69_arg_2 = var_48; [L177] SORT_14 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L178] SORT_1 var_71_arg_0 = var_70; [L179] SORT_14 var_71_arg_1 = var_69; [L180] SORT_14 var_71_arg_2 = state_18; [L181] SORT_14 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L182] SORT_1 var_72_arg_0 = var_33; [L183] SORT_14 var_72_arg_1 = var_15; [L184] SORT_14 var_72_arg_2 = var_71; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] var_72 = var_72 & mask_SORT_14 [L187] SORT_14 next_73_arg_1 = var_72; [L188] SORT_1 var_74_arg_0 = input_3; [L189] SORT_5 var_74_arg_1 = input_6; [L190] SORT_5 var_74_arg_2 = state_29; [L191] SORT_5 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L192] SORT_1 var_75_arg_0 = var_33; [L193] SORT_5 var_75_arg_1 = var_28; [L194] SORT_5 var_75_arg_2 = var_74; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_5 next_76_arg_1 = var_75; [L197] SORT_1 var_77_arg_0 = input_4; [L198] SORT_5 var_77_arg_1 = input_7; [L199] SORT_5 var_77_arg_2 = state_31; [L200] SORT_5 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L201] SORT_1 var_78_arg_0 = var_33; [L202] SORT_5 var_78_arg_1 = var_28; [L203] SORT_5 var_78_arg_2 = var_77; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_5 next_79_arg_1 = var_78; [L206] SORT_1 var_80_arg_0 = var_33; [L207] SORT_8 var_80_arg_1 = input_9; [L208] SORT_8 var_80_arg_2 = state_36; [L209] SORT_8 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L210] SORT_8 next_81_arg_1 = var_80; [L211] SORT_1 var_82_arg_0 = var_33; [L212] SORT_1 var_82_arg_1 = var_24; [L213] SORT_1 var_82_arg_2 = input_3; [L214] SORT_1 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L215] SORT_1 next_83_arg_1 = var_82; [L216] SORT_1 var_84_arg_0 = var_33; [L217] SORT_1 var_84_arg_1 = var_24; [L218] SORT_1 var_84_arg_2 = input_4; [L219] SORT_1 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L220] SORT_1 next_85_arg_1 = var_84; [L221] SORT_1 var_86_arg_0 = input_3; [L222] SORT_5 var_86_arg_1 = input_6; [L223] SORT_5 var_86_arg_2 = state_42; [L224] SORT_5 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L225] SORT_1 var_87_arg_0 = var_33; [L226] SORT_5 var_87_arg_1 = var_28; [L227] SORT_5 var_87_arg_2 = var_86; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_5 next_88_arg_1 = var_87; [L230] SORT_1 var_89_arg_0 = input_4; [L231] SORT_5 var_89_arg_1 = input_7; [L232] SORT_5 var_89_arg_2 = state_44; [L233] SORT_5 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L234] SORT_1 var_90_arg_0 = var_33; [L235] SORT_5 var_90_arg_1 = var_28; [L236] SORT_5 var_90_arg_2 = var_89; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_5 next_91_arg_1 = var_90; [L240] state_11 = next_51_arg_1 [L241] state_16 = next_56_arg_1 [L242] state_18 = next_73_arg_1 [L243] state_29 = next_76_arg_1 [L244] state_31 = next_79_arg_1 [L245] state_36 = next_81_arg_1 [L246] state_38 = next_83_arg_1 [L247] state_40 = next_85_arg_1 [L248] state_42 = next_88_arg_1 [L249] state_44 = next_91_arg_1 [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND FALSE !(!(cond)) [L115] RET __VERIFIER_assert(!(bad_27_arg_0)) [L117] SORT_1 next_51_arg_1 = var_24; [L118] SORT_1 var_33_arg_0 = state_11; [L119] SORT_1 var_33 = ~var_33_arg_0; [L120] var_33 = var_33 & mask_SORT_1 [L121] SORT_5 var_52_arg_0 = state_29; [L122] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L123] SORT_14 var_52 = var_52_arg_0; [L124] SORT_5 var_53_arg_0 = state_31; [L125] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L126] SORT_14 var_53 = var_53_arg_0; [L127] SORT_14 var_54_arg_0 = var_52; [L128] SORT_14 var_54_arg_1 = var_53; [L129] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L130] SORT_1 var_55_arg_0 = var_33; [L131] SORT_14 var_55_arg_1 = var_15; [L132] SORT_14 var_55_arg_2 = var_54; [L133] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L134] var_55 = var_55 & mask_SORT_14 [L135] SORT_14 next_56_arg_1 = var_55; [L136] SORT_1 var_70_arg_0 = state_38; [L137] SORT_1 var_70_arg_1 = state_40; [L138] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L139] var_70 = var_70 & mask_SORT_1 [L140] SORT_8 var_60_arg_0 = state_36; [L141] var_60_arg_0 = var_60_arg_0 & mask_SORT_8 [L142] SORT_5 var_60 = var_60_arg_0; [L143] SORT_5 var_62_arg_0 = var_60; [L144] SORT_5 var_62_arg_1 = var_61; [L145] SORT_1 var_62 = var_62_arg_0 > var_62_arg_1; [L146] SORT_5 var_64_arg_0 = input_6; [L147] SORT_5 var_64_arg_1 = var_63; [L148] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L149] SORT_1 var_65_arg_0 = var_62; [L150] SORT_1 var_65_arg_1 = var_64; [L151] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L152] SORT_5 var_67_arg_0 = input_7; [L153] SORT_5 var_67_arg_1 = var_66; [L154] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L155] SORT_1 var_68_arg_0 = var_65; [L156] SORT_1 var_68_arg_1 = var_67; [L157] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L158] var_68 = var_68 & mask_SORT_1 [L159] SORT_5 var_46_arg_0 = state_42; [L160] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L161] SORT_14 var_46 = var_46_arg_0; [L162] SORT_5 var_47_arg_0 = state_44; [L163] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L164] SORT_14 var_47 = var_47_arg_0; [L165] SORT_14 var_48_arg_0 = var_46; [L166] SORT_14 var_48_arg_1 = var_47; [L167] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L168] SORT_5 var_58_arg_0 = var_57; [L169] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L170] SORT_14 var_58 = var_58_arg_0; [L171] SORT_14 var_59_arg_0 = var_48; [L172] SORT_14 var_59_arg_1 = var_58; [L173] SORT_14 var_59 = var_59_arg_0 + var_59_arg_1; [L174] SORT_1 var_69_arg_0 = var_68; [L175] SORT_14 var_69_arg_1 = var_59; [L176] SORT_14 var_69_arg_2 = var_48; [L177] SORT_14 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L178] SORT_1 var_71_arg_0 = var_70; [L179] SORT_14 var_71_arg_1 = var_69; [L180] SORT_14 var_71_arg_2 = state_18; [L181] SORT_14 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L182] SORT_1 var_72_arg_0 = var_33; [L183] SORT_14 var_72_arg_1 = var_15; [L184] SORT_14 var_72_arg_2 = var_71; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] var_72 = var_72 & mask_SORT_14 [L187] SORT_14 next_73_arg_1 = var_72; [L188] SORT_1 var_74_arg_0 = input_3; [L189] SORT_5 var_74_arg_1 = input_6; [L190] SORT_5 var_74_arg_2 = state_29; [L191] SORT_5 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L192] SORT_1 var_75_arg_0 = var_33; [L193] SORT_5 var_75_arg_1 = var_28; [L194] SORT_5 var_75_arg_2 = var_74; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_5 next_76_arg_1 = var_75; [L197] SORT_1 var_77_arg_0 = input_4; [L198] SORT_5 var_77_arg_1 = input_7; [L199] SORT_5 var_77_arg_2 = state_31; [L200] SORT_5 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L201] SORT_1 var_78_arg_0 = var_33; [L202] SORT_5 var_78_arg_1 = var_28; [L203] SORT_5 var_78_arg_2 = var_77; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_5 next_79_arg_1 = var_78; [L206] SORT_1 var_80_arg_0 = var_33; [L207] SORT_8 var_80_arg_1 = input_9; [L208] SORT_8 var_80_arg_2 = state_36; [L209] SORT_8 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L210] SORT_8 next_81_arg_1 = var_80; [L211] SORT_1 var_82_arg_0 = var_33; [L212] SORT_1 var_82_arg_1 = var_24; [L213] SORT_1 var_82_arg_2 = input_3; [L214] SORT_1 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L215] SORT_1 next_83_arg_1 = var_82; [L216] SORT_1 var_84_arg_0 = var_33; [L217] SORT_1 var_84_arg_1 = var_24; [L218] SORT_1 var_84_arg_2 = input_4; [L219] SORT_1 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L220] SORT_1 next_85_arg_1 = var_84; [L221] SORT_1 var_86_arg_0 = input_3; [L222] SORT_5 var_86_arg_1 = input_6; [L223] SORT_5 var_86_arg_2 = state_42; [L224] SORT_5 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L225] SORT_1 var_87_arg_0 = var_33; [L226] SORT_5 var_87_arg_1 = var_28; [L227] SORT_5 var_87_arg_2 = var_86; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_5 next_88_arg_1 = var_87; [L230] SORT_1 var_89_arg_0 = input_4; [L231] SORT_5 var_89_arg_1 = input_7; [L232] SORT_5 var_89_arg_2 = state_44; [L233] SORT_5 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L234] SORT_1 var_90_arg_0 = var_33; [L235] SORT_5 var_90_arg_1 = var_28; [L236] SORT_5 var_90_arg_2 = var_89; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_5 next_91_arg_1 = var_90; [L240] state_11 = next_51_arg_1 [L241] state_16 = next_56_arg_1 [L242] state_18 = next_73_arg_1 [L243] state_29 = next_76_arg_1 [L244] state_31 = next_79_arg_1 [L245] state_36 = next_81_arg_1 [L246] state_38 = next_83_arg_1 [L247] state_40 = next_85_arg_1 [L248] state_42 = next_88_arg_1 [L249] state_44 = next_91_arg_1 [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 9 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 18 ConstructedInterpolants, 4 QuantifiedInterpolants, 754 SizeOfPredicates, 25 NumberOfNonLiveVariables, 187 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 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 proved your program to be incorrect! [2024-11-07 03:13:46,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE