./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.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.counter.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', '17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d'] 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.counter.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 17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:43:42,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:43:42,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 02:43:42,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:43:42,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:43:42,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:43:42,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:43:42,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:43:42,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:43:42,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:43:42,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:43:42,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:43:42,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:43:42,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:43:42,594 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:43:42,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:43:42,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:43:42,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 02:43:42,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:43:42,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:43:42,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:43:42,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:43:42,594 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:43:42,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:43:42,595 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:43:42,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:43:42,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:43:42,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:43:42,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:43:42,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:43:42,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:43:42,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:43:42,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:43:42,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 02:43:42,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 02:43:42,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:43:42,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:43:42,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:43:42,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:43:42,596 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 -> 17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d [2024-11-07 02:43:42,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:43:42,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:43:42,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:43:42,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:43:42,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:43:42,850 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.counter.c [2024-11-07 02:43:44,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:43:44,214 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:43:44,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c [2024-11-07 02:43:44,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb467014c/30ab17e7cd68459bad0727091372da6d/FLAG4237f0227 [2024-11-07 02:43:44,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb467014c/30ab17e7cd68459bad0727091372da6d [2024-11-07 02:43:44,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:43:44,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:43:44,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:43:44,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:43:44,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:43:44,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f65ec20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44, skipping insertion in model container [2024-11-07 02:43:44,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:43:44,344 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.counter.c[1247,1260] [2024-11-07 02:43:44,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:43:44,378 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:43:44,386 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.counter.c[1247,1260] [2024-11-07 02:43:44,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:43:44,408 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:43:44,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44 WrapperNode [2024-11-07 02:43:44,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:43:44,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:43:44,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:43:44,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:43:44,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,458 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 109 [2024-11-07 02:43:44,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:43:44,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:43:44,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:43:44,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:43:44,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,491 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 02:43:44,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:43:44,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:43:44,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:43:44,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:43:44,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (1/1) ... [2024-11-07 02:43:44,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:43:44,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:43:44,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 02:43:44,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 02:43:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:43:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 02:43:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:43:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:43:44,627 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:43:44,629 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:43:44,852 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-07 02:43:44,853 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:43:44,859 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:43:44,859 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:43:44,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:43:44 BoogieIcfgContainer [2024-11-07 02:43:44,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:43:44,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:43:44,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:43:44,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:43:44,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:43:44" (1/3) ... [2024-11-07 02:43:44,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629e219b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:43:44, skipping insertion in model container [2024-11-07 02:43:44,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:44" (2/3) ... [2024-11-07 02:43:44,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629e219b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:43:44, skipping insertion in model container [2024-11-07 02:43:44,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:43:44" (3/3) ... [2024-11-07 02:43:44,868 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter.c [2024-11-07 02:43:44,879 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:43:44,879 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:43:44,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:43:44,929 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;@184d92c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:43:44,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:43:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 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 02:43:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 02:43:44,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:43:44,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:43:44,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:43:44,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:43:44,943 INFO L85 PathProgramCache]: Analyzing trace with hash -209312282, now seen corresponding path program 1 times [2024-11-07 02:43:44,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:43:44,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179877486] [2024-11-07 02:43:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:43:44,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:43:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:43:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:43:45,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:43:45,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179877486] [2024-11-07 02:43:45,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179877486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:43:45,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:43:45,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:43:45,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738385307] [2024-11-07 02:43:45,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:43:45,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:43:45,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:43:45,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:43:45,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:43:45,308 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 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) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:43:45,338 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2024-11-07 02:43:45,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:43:45,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-07 02:43:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:43:45,344 INFO L225 Difference]: With dead ends: 53 [2024-11-07 02:43:45,344 INFO L226 Difference]: Without dead ends: 29 [2024-11-07 02:43:45,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:43:45,350 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:43:45,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:43:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-07 02:43:45,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-07 02:43:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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 02:43:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-11-07 02:43:45,373 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 13 [2024-11-07 02:43:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:43:45,373 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-11-07 02:43:45,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-07 02:43:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 02:43:45,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:43:45,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:43:45,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 02:43:45,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:43:45,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:43:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2102949055, now seen corresponding path program 1 times [2024-11-07 02:43:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:43:45,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028581752] [2024-11-07 02:43:45,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:43:45,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:43:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:43:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:43:45,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:43:45,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028581752] [2024-11-07 02:43:45,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028581752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:43:45,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:43:45,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:43:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143338027] [2024-11-07 02:43:45,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:43:45,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:43:45,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:43:45,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:43:45,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:43:45,511 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:45,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:43:45,536 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2024-11-07 02:43:45,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:43:45,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 14 [2024-11-07 02:43:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:43:45,537 INFO L225 Difference]: With dead ends: 54 [2024-11-07 02:43:45,537 INFO L226 Difference]: Without dead ends: 31 [2024-11-07 02:43:45,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:43:45,537 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:43:45,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:43:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-07 02:43:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-07 02:43:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 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 02:43:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-07 02:43:45,540 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 14 [2024-11-07 02:43:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:43:45,542 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-07 02:43:45,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-07 02:43:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 02:43:45,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:43:45,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:43:45,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 02:43:45,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:43:45,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:43:45,545 INFO L85 PathProgramCache]: Analyzing trace with hash -331054625, now seen corresponding path program 1 times [2024-11-07 02:43:45,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:43:45,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844895037] [2024-11-07 02:43:45,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:43:45,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:43:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:43:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:43:45,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:43:45,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844895037] [2024-11-07 02:43:45,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844895037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:43:45,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:43:45,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:43:45,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616288614] [2024-11-07 02:43:45,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:43:45,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:43:45,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:43:45,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:43:45,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:43:45,689 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:43:45,712 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2024-11-07 02:43:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:43:45,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-11-07 02:43:45,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:43:45,713 INFO L225 Difference]: With dead ends: 54 [2024-11-07 02:43:45,713 INFO L226 Difference]: Without dead ends: 29 [2024-11-07 02:43:45,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:43:45,714 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:43:45,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 61 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:43:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-07 02:43:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-07 02:43:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-07 02:43:45,718 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2024-11-07 02:43:45,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:43:45,718 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-07 02:43:45,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-07 02:43:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 02:43:45,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:43:45,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:43:45,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 02:43:45,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:43:45,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:43:45,719 INFO L85 PathProgramCache]: Analyzing trace with hash -108213630, now seen corresponding path program 1 times [2024-11-07 02:43:45,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:43:45,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739757822] [2024-11-07 02:43:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:43:45,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:43:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:43:45,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 02:43:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:43:45,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 02:43:45,771 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 02:43:45,772 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 02:43:45,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 02:43:45,775 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 02:43:45,791 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 02:43:45,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:43:45 BoogieIcfgContainer [2024-11-07 02:43:45,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 02:43:45,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 02:43:45,797 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 02:43:45,797 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 02:43:45,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:43:44" (3/4) ... [2024-11-07 02:43:45,799 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 02:43:45,800 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 02:43:45,801 INFO L158 Benchmark]: Toolchain (without parser) took 1566.63ms. Allocated memory is still 100.7MB. Free memory was 77.5MB in the beginning and 34.2MB in the end (delta: 43.3MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2024-11-07 02:43:45,801 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:43:45,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.06ms. Allocated memory is still 100.7MB. Free memory was 77.4MB in the beginning and 65.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 02:43:45,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.00ms. Allocated memory is still 100.7MB. Free memory was 65.7MB in the beginning and 62.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 02:43:45,804 INFO L158 Benchmark]: Boogie Preprocessor took 48.96ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 60.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:43:45,804 INFO L158 Benchmark]: RCFGBuilder took 347.96ms. Allocated memory is still 100.7MB. Free memory was 60.9MB in the beginning and 43.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:43:45,804 INFO L158 Benchmark]: TraceAbstraction took 935.70ms. Allocated memory is still 100.7MB. Free memory was 43.2MB in the beginning and 34.8MB in the end (delta: 8.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-11-07 02:43:45,804 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 100.7MB. Free memory was 34.8MB in the beginning and 34.2MB in the end (delta: 584.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:43:45,805 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.06ms. Allocated memory is still 100.7MB. Free memory was 77.4MB in the beginning and 65.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.00ms. Allocated memory is still 100.7MB. Free memory was 65.7MB in the beginning and 62.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.96ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 60.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 347.96ms. Allocated memory is still 100.7MB. Free memory was 60.9MB in the beginning and 43.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 935.70ms. Allocated memory is still 100.7MB. Free memory was 43.2MB in the beginning and 34.8MB in the end (delta: 8.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 100.7MB. Free memory was 34.8MB in the beginning and 34.2MB in the end (delta: 584.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 58. 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 1; [L33] const SORT_4 var_8 = 0; [L34] const SORT_1 var_12 = 1; [L35] const SORT_4 var_18 = 15; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_18=15, var_5=1, var_8=0] [L40] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L42] SORT_4 init_7_arg_1 = var_5; [L43] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_3 = __VERIFIER_nondet_uchar() [L48] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_9_arg_0 = state_6; [L52] SORT_4 var_9_arg_1 = var_8; [L53] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L54] SORT_1 var_13_arg_0 = var_9; [L55] SORT_1 var_13 = ~var_13_arg_0; [L56] SORT_1 var_14_arg_0 = var_12; [L57] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_18=15, var_5=1, var_8=0] [L58] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L58] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L59] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L59] var_14 = var_14 & mask_SORT_1 [L60] SORT_1 bad_15_arg_0 = var_14; [L61] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 101 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 74 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 02:43:45,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.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 17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:43:47,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:43:47,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 02:43:47,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:43:47,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:43:47,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:43:47,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:43:47,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:43:47,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:43:47,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:43:47,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:43:47,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:43:47,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:43:47,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:43:47,715 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:43:47,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:43:47,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:43:47,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:43:47,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:43:47,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:43:47,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:43:47,716 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 02:43:47,717 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 02:43:47,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:43:47,717 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 02:43:47,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:43:47,717 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:43:47,717 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:43:47,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:43:47,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:43:47,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:43:47,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:43:47,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:43:47,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:43:47,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:43:47,718 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 02:43:47,718 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 02:43:47,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:43:47,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:43:47,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:43:47,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:43:47,718 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 -> 17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d [2024-11-07 02:43:47,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:43:47,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:43:47,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:43:47,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:43:47,981 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:43:47,982 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.counter.c [2024-11-07 02:43:49,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:43:49,353 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:43:49,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c [2024-11-07 02:43:49,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88fca7655/149304a9ec954738bbafd6c7c65f25ba/FLAG37d5ea298 [2024-11-07 02:43:49,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88fca7655/149304a9ec954738bbafd6c7c65f25ba [2024-11-07 02:43:49,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:43:49,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:43:49,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:43:49,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:43:49,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:43:49,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a718ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49, skipping insertion in model container [2024-11-07 02:43:49,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:43:49,852 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.counter.c[1247,1260] [2024-11-07 02:43:49,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:43:49,884 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:43:49,892 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.counter.c[1247,1260] [2024-11-07 02:43:49,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:43:49,924 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:43:49,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49 WrapperNode [2024-11-07 02:43:49,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:43:49,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:43:49,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:43:49,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:43:49,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,954 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-11-07 02:43:49,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:43:49,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:43:49,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:43:49,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:43:49,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,971 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 02:43:49,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:43:49,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:43:49,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:43:49,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:43:49,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (1/1) ... [2024-11-07 02:43:49,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:43:50,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:43:50,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 02:43:50,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 02:43:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:43:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 02:43:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:43:50,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:43:50,104 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:43:50,105 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:43:50,216 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 02:43:50,216 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:43:50,221 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:43:50,222 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:43:50,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:43:50 BoogieIcfgContainer [2024-11-07 02:43:50,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:43:50,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:43:50,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:43:50,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:43:50,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:43:49" (1/3) ... [2024-11-07 02:43:50,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1b0613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:43:50, skipping insertion in model container [2024-11-07 02:43:50,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:43:49" (2/3) ... [2024-11-07 02:43:50,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1b0613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:43:50, skipping insertion in model container [2024-11-07 02:43:50,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:43:50" (3/3) ... [2024-11-07 02:43:50,230 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter.c [2024-11-07 02:43:50,240 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:43:50,241 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:43:50,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:43:50,285 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;@17559261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:43:50,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:43:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 02:43:50,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:43:50,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 02:43:50,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:43:50,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:43:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 02:43:50,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:43:50,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78133012] [2024-11-07 02:43:50,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:43:50,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:43:50,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:43:50,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:43:50,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 02:43:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:43:50,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 02:43:50,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:43:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:43:50,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 02:43:50,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:43:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78133012] [2024-11-07 02:43:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78133012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:43:50,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:43:50,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:43:50,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827320003] [2024-11-07 02:43:50,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:43:50,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:43:50,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:43:50,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:43:50,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:43:50,601 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:43:50,635 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-07 02:43:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:43:50,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 02:43:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:43:50,644 INFO L225 Difference]: With dead ends: 18 [2024-11-07 02:43:50,645 INFO L226 Difference]: Without dead ends: 10 [2024-11-07 02:43:50,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:43:50,649 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:43:50,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:43:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-07 02:43:50,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-07 02:43:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 02:43:50,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 02:43:50,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:43:50,671 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 02:43:50,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 02:43:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 02:43:50,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:43:50,672 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 02:43:50,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 02:43:50,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:43:50,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:43:50,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:43:50,874 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 02:43:50,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:43:50,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973161391] [2024-11-07 02:43:50,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:43:50,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:43:50,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:43:50,877 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:43:50,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 02:43:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:43:50,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 02:43:50,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:43:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:43:51,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:43:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:43:51,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:43:51,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973161391] [2024-11-07 02:43:51,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973161391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 02:43:51,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 02:43:51,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 02:43:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201980893] [2024-11-07 02:43:51,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 02:43:51,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:43:51,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:43:51,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:43:51,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:43:51,601 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:43:51,812 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-07 02:43:51,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:43:51,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-07 02:43:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:43:51,813 INFO L225 Difference]: With dead ends: 18 [2024-11-07 02:43:51,813 INFO L226 Difference]: Without dead ends: 16 [2024-11-07 02:43:51,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:43:51,814 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:43:51,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:43:51,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-07 02:43:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-07 02:43:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-07 02:43:51,817 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-07 02:43:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:43:51,817 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-07 02:43:51,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-07 02:43:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 02:43:51,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:43:51,818 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-07 02:43:51,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 02:43:52,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:43:52,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:43:52,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:43:52,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-07 02:43:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:43:52,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111616647] [2024-11-07 02:43:52,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 02:43:52,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:43:52,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:43:52,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:43:52,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 02:43:52,082 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 02:43:52,082 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 02:43:52,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 02:43:52,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:43:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:43:52,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:43:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:43:56,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:43:56,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111616647] [2024-11-07 02:43:56,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111616647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 02:43:56,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 02:43:56,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-07 02:43:56,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739998306] [2024-11-07 02:43:56,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 02:43:56,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 02:43:56,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:43:56,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 02:43:56,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:43:56,654 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:43:58,350 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-07 02:43:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 02:43:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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 14 [2024-11-07 02:43:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:43:58,350 INFO L225 Difference]: With dead ends: 30 [2024-11-07 02:43:58,350 INFO L226 Difference]: Without dead ends: 28 [2024-11-07 02:43:58,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-11-07 02:43:58,351 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:43:58,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:43:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-07 02:43:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-07 02:43:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-07 02:43:58,356 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-07 02:43:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:43:58,356 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-07 02:43:58,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:43:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-07 02:43:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 02:43:58,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:43:58,357 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-07 02:43:58,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 02:43:58,558 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 02:43:58,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:43:58,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:43:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-07 02:43:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:43:58,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152147283] [2024-11-07 02:43:58,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 02:43:58,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:43:58,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:43:58,561 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:43:58,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 02:43:58,614 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-07 02:43:58,615 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 02:43:58,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 02:43:58,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:43:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-07 02:43:59,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:44:04,994 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse79 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse84 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_12~0#1|)) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse20 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_5~0#1|))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse20)))))))) (.cse3 (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) .cse84)))))))) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|)) (.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_18~0#1|))) (let ((.cse35 (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse86 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse85 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse86 .cse20))))))) .cse5))))) (or (= .cse4 .cse85) (not (= .cse8 .cse85)) (= .cse86 .cse8))))))) (.cse1 (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse84)))))))) (.cse10 (= .cse19 .cse4)) (.cse0 (forall ((|v_ULTIMATE.start_main_~var_14_arg_0~0#1_31| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_14_arg_0~0#1_31|) (_ bv254 32)))))))))) (let ((.cse13 (or .cse0 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse83 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse82 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse83))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse82)))))) (not (= .cse8 .cse82)) (= .cse83 .cse8))))))) (.cse67 (or .cse0 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse81 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse80 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse81))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse80)))))) (not (= .cse8 .cse80)) (not (= .cse81 .cse8)))))))) (.cse11 (forall ((|v_ULTIMATE.start_main_~var_14_arg_0~0#1_31| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_14_arg_0~0#1_31|) (_ bv255 32))))))))) (.cse12 (not .cse10)) (.cse42 (and .cse35 (or .cse1 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse78 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse78 .cse20))))))) .cse5))))) (= .cse78 .cse8)))))))) (and (or .cse0 (let ((.cse2 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse7 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse7))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse6)))))) (= .cse7 .cse8) (= .cse8 .cse6))))))) (and (or .cse1 .cse2) (or .cse3 .cse2)))) (or .cse3 (let ((.cse9 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse15))))))) (or (not (= .cse8 .cse14)) (= .cse4 .cse14) (= .cse15 .cse8))))))) (and (or .cse9 .cse0 .cse10) (or .cse9 .cse11 .cse12) .cse13))) (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|) .cse8))) (let ((.cse22 (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse19)))))))) (let ((.cse17 (or .cse22 .cse0)) (.cse18 (or .cse11 (not .cse22))) (.cse21 (= .cse8 .cse19))) (and (or (let ((.cse16 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 .cse20))))))) .cse5))) .cse4))) (and (or .cse0 .cse16) .cse17 .cse18 (or .cse11 (not .cse16)))) .cse21) (or (and (or .cse0 .cse10) .cse17 (or .cse11 .cse12) .cse18) (not .cse21))))) (and (or .cse3 .cse10) .cse1)) (or .cse0 (and (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse20))))))) .cse5))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse23)))))) (= .cse8 .cse23) (= .cse24 .cse8))))) .cse1) (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse20))))))) .cse5))))) (or (= .cse4 .cse25) (= .cse8 .cse25) (= .cse26 .cse8)))))))) (or (and (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse28))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 .cse20))))))))))) (not (= .cse28 .cse8)) (= .cse4 .cse27) (= .cse8 .cse27))))) .cse3) (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse30))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse20))))))))))) (not (= .cse30 .cse8)) (= .cse8 .cse29))))) .cse1)) .cse0) (or .cse11 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse32 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse20))))))) .cse5))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse31))))))) (not (= .cse8 .cse31)) (= .cse32 .cse8))))) .cse1) (or .cse0 (and (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse34 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse20))))))) .cse5))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse33)))))) (not (= .cse8 .cse33)) (= .cse34 .cse8))))) .cse1) .cse35)) (or (let ((.cse36 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse39 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse39))))))) (= .cse39 .cse8)))))) (and (or .cse11 .cse36 .cse12) (or .cse0 .cse36 .cse10) (or .cse11 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse38 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse38))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse37))))))) (not (= .cse8 .cse37)) (= .cse38 .cse8)))))) .cse13)) .cse1) (or .cse11 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse41 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse41))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse40))))))) (= .cse41 .cse8) (= .cse8 .cse40))))) .cse1) (or .cse0 .cse10 .cse42) (or .cse11 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse44 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse44))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse43))))))) (not (= .cse44 .cse8)) (= .cse8 .cse43))))) .cse1) (or .cse11 (and (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse46))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse20)))))))))))) (= .cse4 .cse45) (= .cse46 .cse8) (= .cse8 .cse45)))))) (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse48 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse48))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 .cse20)))))))))))) (= .cse48 .cse8) (= .cse8 .cse47))))) .cse1))) (or .cse0 (and (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse50 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse50))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse49 .cse20))))))))))) (= .cse4 .cse49) (= .cse50 .cse8) (= .cse8 .cse49)))))) (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse52 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse52))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse51 .cse20))))))))))) (= .cse52 .cse8) (= .cse8 .cse51))))) .cse1))) (or (and (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse54 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse54 .cse20))))))) .cse5))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse53 .cse20))))))))))) (= .cse8 .cse53) (= .cse54 .cse8))))) .cse1) (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse56 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse55 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse56 .cse20))))))) .cse5))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse55 .cse20))))))))))) (= .cse4 .cse55) (= .cse8 .cse55) (= .cse56 .cse8))))))) .cse0) (or (and (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse58 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse58))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse57 .cse20)))))))))))) (not (= .cse58 .cse8)) (= .cse4 .cse57) (= .cse8 .cse57)))))) (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse60 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse60))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse59 .cse20)))))))))))) (not (= .cse60 .cse8)) (= .cse8 .cse59))))) .cse1)) .cse11) (or .cse0 (let ((.cse61 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse63 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse63))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse62)))))) (not (= .cse63 .cse8)) (= .cse8 .cse62))))))) (and (or .cse1 .cse61) (or .cse3 .cse61)))) (or (let ((.cse64 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse68 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse68))))))) (not (= .cse68 .cse8))))))) (and (or .cse11 .cse64 .cse12) (or .cse0 .cse64 .cse10) (or .cse11 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse66 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse65 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse66))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse65))))))) (not (= .cse8 .cse65)) (not (= .cse66 .cse8))))))) .cse67)) .cse1) (or .cse3 (let ((.cse69 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse71 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse70 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse71))))))) (or (not (= .cse8 .cse70)) (not (= .cse71 .cse8)) (= .cse4 .cse70))))))) (and (or .cse0 .cse10 .cse69) .cse67 (or .cse11 .cse69 .cse12)))) (or .cse11 (and (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse73 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse73 .cse20))))))) .cse5))))) (or (= .cse4 .cse72) (= .cse8 .cse72) (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse72 .cse20)))))))))))) (= .cse73 .cse8)))))) (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse75 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse74 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse75 .cse20))))))) .cse5))))) (or (= .cse8 .cse74) (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse74 .cse20)))))))))))) (= .cse75 .cse8))))) .cse1))) (or .cse11 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse77 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse77 .cse20))))))) .cse5))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse76))))))) (= .cse8 .cse76) (= .cse77 .cse8))))) .cse1) (or .cse11 .cse12 .cse42)))))) is different from false