./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul10.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul10.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 37bf2f4a0d13654afdfd5cdecda47a5234857be125596f55f94b7f56efc2af18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:39:50,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:39:50,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 07:39:50,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:39:50,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:39:50,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:39:50,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:39:50,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:39:50,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:39:50,321 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:39:50,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:39:50,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:39:50,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:39:50,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:39:50,322 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:39:50,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:39:50,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:39:50,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 07:39:50,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:39:50,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:39:50,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:39:50,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:39:50,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:39:50,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:39:50,323 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:39:50,323 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:39:50,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:39:50,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:39:50,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:39:50,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:39:50,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:39:50,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:39:50,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:39:50,325 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 -> 37bf2f4a0d13654afdfd5cdecda47a5234857be125596f55f94b7f56efc2af18 [2025-01-09 07:39:50,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:39:50,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:39:50,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:39:50,551 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:39:50,552 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:39:50,552 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.mul10.c [2025-01-09 07:39:51,831 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/096a8c2da/ada641e679094eee8b89e878d099775b/FLAG11173f77a [2025-01-09 07:39:52,114 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:39:52,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul10.c [2025-01-09 07:39:52,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/096a8c2da/ada641e679094eee8b89e878d099775b/FLAG11173f77a [2025-01-09 07:39:52,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/096a8c2da/ada641e679094eee8b89e878d099775b [2025-01-09 07:39:52,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:39:52,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:39:52,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:39:52,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:39:52,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:39:52,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:52,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b46125c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52, skipping insertion in model container [2025-01-09 07:39:52,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:52,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:39:52,536 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.mul10.c[1245,1258] [2025-01-09 07:39:52,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:39:52,648 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:39:52,655 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.mul10.c[1245,1258] [2025-01-09 07:39:52,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:39:52,733 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:39:52,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52 WrapperNode [2025-01-09 07:39:52,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:39:52,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:39:52,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:39:52,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:39:52,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:52,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:52,883 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1762 [2025-01-09 07:39:52,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:39:52,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:39:52,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:39:52,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:39:52,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:52,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:52,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:53,045 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-01-09 07:39:53,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:53,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:53,097 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:53,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:53,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:53,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:53,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:53,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:39:53,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:39:53,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:39:53,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:39:53,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (1/1) ... [2025-01-09 07:39:53,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:39:53,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:39:53,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:39:53,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:39:53,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:39:53,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 07:39:53,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 07:39:53,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:39:53,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:39:53,389 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:39:53,391 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:39:54,979 INFO L? ?]: Removed 896 outVars from TransFormulas that were not future-live. [2025-01-09 07:39:54,979 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:39:54,996 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:39:54,996 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:39:54,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:39:54 BoogieIcfgContainer [2025-01-09 07:39:54,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:39:54,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:39:54,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:39:55,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:39:55,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:39:52" (1/3) ... [2025-01-09 07:39:55,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609f9cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:39:55, skipping insertion in model container [2025-01-09 07:39:55,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:39:52" (2/3) ... [2025-01-09 07:39:55,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609f9cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:39:55, skipping insertion in model container [2025-01-09 07:39:55,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:39:54" (3/3) ... [2025-01-09 07:39:55,005 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul10.c [2025-01-09 07:39:55,017 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:39:55,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul10.c that has 1 procedures, 523 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:39:55,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:39:55,071 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;@14e7cd4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:39:55,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:39:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 523 states, 521 states have (on average 1.510556621880998) internal successors, (787), 522 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 07:39:55,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:55,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:55,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:55,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:55,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1110556540, now seen corresponding path program 1 times [2025-01-09 07:39:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:55,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808460255] [2025-01-09 07:39:55,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:55,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 07:39:55,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 07:39:55,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:55,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:39:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:39:56,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:39:56,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808460255] [2025-01-09 07:39:56,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808460255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:39:56,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:39:56,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:39:56,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000998065] [2025-01-09 07:39:56,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:39:56,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:39:56,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:39:56,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:39:56,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:39:56,053 INFO L87 Difference]: Start difference. First operand has 523 states, 521 states have (on average 1.510556621880998) internal successors, (787), 522 states have internal predecessors, (787), 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 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:39:56,186 INFO L93 Difference]: Finished difference Result 927 states and 1399 transitions. [2025-01-09 07:39:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:39:56,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 95 [2025-01-09 07:39:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:39:56,206 INFO L225 Difference]: With dead ends: 927 [2025-01-09 07:39:56,208 INFO L226 Difference]: Without dead ends: 522 [2025-01-09 07:39:56,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:39:56,216 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 0 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:39:56,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2337 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:39:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-01-09 07:39:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-01-09 07:39:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.506717850287908) internal successors, (785), 521 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 785 transitions. [2025-01-09 07:39:56,288 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 785 transitions. Word has length 95 [2025-01-09 07:39:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:39:56,289 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 785 transitions. [2025-01-09 07:39:56,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 785 transitions. [2025-01-09 07:39:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 07:39:56,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:56,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:56,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 07:39:56,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:56,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash 69210110, now seen corresponding path program 1 times [2025-01-09 07:39:56,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:56,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243276558] [2025-01-09 07:39:56,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:56,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 07:39:56,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 07:39:56,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:56,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:39:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:39:56,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:39:56,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243276558] [2025-01-09 07:39:56,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243276558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:39:56,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:39:56,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:39:56,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977275934] [2025-01-09 07:39:56,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:39:56,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:39:56,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:39:56,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:39:56,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:39:56,519 INFO L87 Difference]: Start difference. First operand 522 states and 785 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:39:56,556 INFO L93 Difference]: Finished difference Result 928 states and 1397 transitions. [2025-01-09 07:39:56,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:39:56,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 96 [2025-01-09 07:39:56,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:39:56,559 INFO L225 Difference]: With dead ends: 928 [2025-01-09 07:39:56,559 INFO L226 Difference]: Without dead ends: 524 [2025-01-09 07:39:56,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:39:56,561 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 0 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:39:56,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2333 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:39:56,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-01-09 07:39:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-01-09 07:39:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.5047801147227533) internal successors, (787), 523 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 787 transitions. [2025-01-09 07:39:56,576 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 787 transitions. Word has length 96 [2025-01-09 07:39:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:39:56,577 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 787 transitions. [2025-01-09 07:39:56,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 787 transitions. [2025-01-09 07:39:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 07:39:56,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:56,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:56,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 07:39:56,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:56,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1047548053, now seen corresponding path program 1 times [2025-01-09 07:39:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:56,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339220569] [2025-01-09 07:39:56,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:56,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:56,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 07:39:56,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 07:39:56,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:56,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:39:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:39:57,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:39:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339220569] [2025-01-09 07:39:57,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339220569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:39:57,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:39:57,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:39:57,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421790705] [2025-01-09 07:39:57,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:39:57,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:39:57,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:39:57,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:39:57,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:39:57,042 INFO L87 Difference]: Start difference. First operand 524 states and 787 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:39:57,123 INFO L93 Difference]: Finished difference Result 934 states and 1404 transitions. [2025-01-09 07:39:57,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:39:57,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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 97 [2025-01-09 07:39:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:39:57,126 INFO L225 Difference]: With dead ends: 934 [2025-01-09 07:39:57,126 INFO L226 Difference]: Without dead ends: 528 [2025-01-09 07:39:57,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:39:57,129 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 700 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:39:57,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 2302 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:39:57,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-01-09 07:39:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 527. [2025-01-09 07:39:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.5019011406844107) internal successors, (790), 526 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 790 transitions. [2025-01-09 07:39:57,139 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 790 transitions. Word has length 97 [2025-01-09 07:39:57,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:39:57,139 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 790 transitions. [2025-01-09 07:39:57,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 790 transitions. [2025-01-09 07:39:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 07:39:57,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:57,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:57,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 07:39:57,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:57,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash -321203039, now seen corresponding path program 1 times [2025-01-09 07:39:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:57,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681415678] [2025-01-09 07:39:57,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:57,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 07:39:57,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 07:39:57,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:57,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:39:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:39:58,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:39:58,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681415678] [2025-01-09 07:39:58,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681415678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:39:58,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:39:58,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 07:39:58,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118028456] [2025-01-09 07:39:58,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:39:58,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 07:39:58,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:39:58,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 07:39:58,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 07:39:58,007 INFO L87 Difference]: Start difference. First operand 527 states and 790 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:39:58,087 INFO L93 Difference]: Finished difference Result 959 states and 1437 transitions. [2025-01-09 07:39:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 07:39:58,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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 98 [2025-01-09 07:39:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:39:58,089 INFO L225 Difference]: With dead ends: 959 [2025-01-09 07:39:58,089 INFO L226 Difference]: Without dead ends: 550 [2025-01-09 07:39:58,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 07:39:58,091 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 24 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:39:58,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3875 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:39:58,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-01-09 07:39:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 535. [2025-01-09 07:39:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.5) internal successors, (801), 534 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 801 transitions. [2025-01-09 07:39:58,104 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 801 transitions. Word has length 98 [2025-01-09 07:39:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:39:58,104 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 801 transitions. [2025-01-09 07:39:58,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 801 transitions. [2025-01-09 07:39:58,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 07:39:58,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:58,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:58,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 07:39:58,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:58,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:58,107 INFO L85 PathProgramCache]: Analyzing trace with hash 421990236, now seen corresponding path program 1 times [2025-01-09 07:39:58,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:58,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087157738] [2025-01-09 07:39:58,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:58,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:58,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 07:39:58,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 07:39:58,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:58,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:39:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:39:58,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:39:58,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087157738] [2025-01-09 07:39:58,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087157738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:39:58,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:39:58,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 07:39:58,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222101888] [2025-01-09 07:39:58,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:39:58,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 07:39:58,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:39:58,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 07:39:58,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:39:58,747 INFO L87 Difference]: Start difference. First operand 535 states and 801 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:39:58,857 INFO L93 Difference]: Finished difference Result 970 states and 1452 transitions. [2025-01-09 07:39:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 07:39:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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 99 [2025-01-09 07:39:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:39:58,860 INFO L225 Difference]: With dead ends: 970 [2025-01-09 07:39:58,860 INFO L226 Difference]: Without dead ends: 553 [2025-01-09 07:39:58,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:39:58,861 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 17 mSDsluCounter, 4622 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5395 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:39:58,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5395 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:39:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-01-09 07:39:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 541. [2025-01-09 07:39:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.4981481481481482) internal successors, (809), 540 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 809 transitions. [2025-01-09 07:39:58,879 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 809 transitions. Word has length 99 [2025-01-09 07:39:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:39:58,880 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 809 transitions. [2025-01-09 07:39:58,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 809 transitions. [2025-01-09 07:39:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 07:39:58,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:58,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:58,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 07:39:58,881 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:58,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash -233668064, now seen corresponding path program 1 times [2025-01-09 07:39:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:58,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107026713] [2025-01-09 07:39:58,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:58,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:58,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 07:39:58,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 07:39:58,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:58,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:39:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:39:59,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:39:59,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107026713] [2025-01-09 07:39:59,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107026713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:39:59,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:39:59,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:39:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483940988] [2025-01-09 07:39:59,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:39:59,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:39:59,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:39:59,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:39:59,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:39:59,287 INFO L87 Difference]: Start difference. First operand 541 states and 809 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:39:59,364 INFO L93 Difference]: Finished difference Result 962 states and 1440 transitions. [2025-01-09 07:39:59,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:39:59,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 99 [2025-01-09 07:39:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:39:59,367 INFO L225 Difference]: With dead ends: 962 [2025-01-09 07:39:59,367 INFO L226 Difference]: Without dead ends: 539 [2025-01-09 07:39:59,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:39:59,370 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 691 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 3046 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:39:59,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 3046 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:39:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-09 07:39:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 536. [2025-01-09 07:39:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.4990654205607477) internal successors, (802), 535 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 802 transitions. [2025-01-09 07:39:59,384 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 802 transitions. Word has length 99 [2025-01-09 07:39:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:39:59,384 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 802 transitions. [2025-01-09 07:39:59,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 802 transitions. [2025-01-09 07:39:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 07:39:59,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:59,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:59,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 07:39:59,385 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:59,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:59,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2045514421, now seen corresponding path program 1 times [2025-01-09 07:39:59,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:59,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186655734] [2025-01-09 07:39:59,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:59,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:59,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 07:39:59,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 07:39:59,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:59,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:39:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:39:59,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:39:59,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186655734] [2025-01-09 07:39:59,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186655734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:39:59,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:39:59,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:39:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541634503] [2025-01-09 07:39:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:39:59,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:39:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:39:59,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:39:59,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:39:59,719 INFO L87 Difference]: Start difference. First operand 536 states and 802 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:39:59,859 INFO L93 Difference]: Finished difference Result 1218 states and 1823 transitions. [2025-01-09 07:39:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:39:59,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 99 [2025-01-09 07:39:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:39:59,863 INFO L225 Difference]: With dead ends: 1218 [2025-01-09 07:39:59,863 INFO L226 Difference]: Without dead ends: 800 [2025-01-09 07:39:59,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:39:59,865 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 1076 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:39:59,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 3010 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:39:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-09 07:39:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 580. [2025-01-09 07:39:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.4956822107081174) internal successors, (866), 579 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 866 transitions. [2025-01-09 07:39:59,878 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 866 transitions. Word has length 99 [2025-01-09 07:39:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:39:59,878 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 866 transitions. [2025-01-09 07:39:59,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:39:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 866 transitions. [2025-01-09 07:39:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 07:39:59,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:39:59,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:39:59,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 07:39:59,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:39:59,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:39:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1115839538, now seen corresponding path program 1 times [2025-01-09 07:39:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:39:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936226103] [2025-01-09 07:39:59,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:39:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:39:59,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 07:39:59,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 07:39:59,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:39:59,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:00,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:40:00,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936226103] [2025-01-09 07:40:00,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936226103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:40:00,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:40:00,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:40:00,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655416332] [2025-01-09 07:40:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:40:00,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:40:00,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:40:00,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:40:00,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:40:00,178 INFO L87 Difference]: Start difference. First operand 580 states and 866 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:40:00,229 INFO L93 Difference]: Finished difference Result 1172 states and 1751 transitions. [2025-01-09 07:40:00,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:40:00,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 99 [2025-01-09 07:40:00,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:40:00,233 INFO L225 Difference]: With dead ends: 1172 [2025-01-09 07:40:00,233 INFO L226 Difference]: Without dead ends: 750 [2025-01-09 07:40:00,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:40:00,234 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 1002 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:40:00,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 2315 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:40:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-01-09 07:40:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 578. [2025-01-09 07:40:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.4922010398613519) internal successors, (861), 577 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 861 transitions. [2025-01-09 07:40:00,246 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 861 transitions. Word has length 99 [2025-01-09 07:40:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:40:00,247 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 861 transitions. [2025-01-09 07:40:00,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 861 transitions. [2025-01-09 07:40:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 07:40:00,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:00,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:00,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 07:40:00,250 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:00,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1659851431, now seen corresponding path program 1 times [2025-01-09 07:40:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:40:00,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197331471] [2025-01-09 07:40:00,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:40:00,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 07:40:00,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 07:40:00,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:00,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:00,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:40:00,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197331471] [2025-01-09 07:40:00,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197331471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:40:00,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:40:00,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:40:00,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371010821] [2025-01-09 07:40:00,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:40:00,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:40:00,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:40:00,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:40:00,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:40:00,507 INFO L87 Difference]: Start difference. First operand 578 states and 861 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:40:00,581 INFO L93 Difference]: Finished difference Result 1208 states and 1802 transitions. [2025-01-09 07:40:00,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:40:00,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 99 [2025-01-09 07:40:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:40:00,584 INFO L225 Difference]: With dead ends: 1208 [2025-01-09 07:40:00,584 INFO L226 Difference]: Without dead ends: 784 [2025-01-09 07:40:00,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:40:00,586 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 1386 mSDsluCounter, 2297 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 3072 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:40:00,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 3072 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:40:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-01-09 07:40:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 576. [2025-01-09 07:40:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 1.488695652173913) internal successors, (856), 575 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 856 transitions. [2025-01-09 07:40:00,599 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 856 transitions. Word has length 99 [2025-01-09 07:40:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:40:00,599 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 856 transitions. [2025-01-09 07:40:00,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 856 transitions. [2025-01-09 07:40:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 07:40:00,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:00,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:00,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 07:40:00,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:00,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:00,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1924181824, now seen corresponding path program 1 times [2025-01-09 07:40:00,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:40:00,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476860223] [2025-01-09 07:40:00,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:00,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:40:00,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 07:40:00,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 07:40:00,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:00,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:00,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:40:00,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476860223] [2025-01-09 07:40:00,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476860223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:40:00,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:40:00,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:40:00,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546525829] [2025-01-09 07:40:00,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:40:00,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:40:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:40:00,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:40:00,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:40:00,905 INFO L87 Difference]: Start difference. First operand 576 states and 856 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:40:00,959 INFO L93 Difference]: Finished difference Result 994 states and 1482 transitions. [2025-01-09 07:40:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:40:00,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 99 [2025-01-09 07:40:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:40:00,962 INFO L225 Difference]: With dead ends: 994 [2025-01-09 07:40:00,962 INFO L226 Difference]: Without dead ends: 568 [2025-01-09 07:40:00,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:40:00,963 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 771 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 2316 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:40:00,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 2316 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:40:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-09 07:40:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2025-01-09 07:40:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 1.492063492063492) internal successors, (846), 567 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 846 transitions. [2025-01-09 07:40:00,975 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 846 transitions. Word has length 99 [2025-01-09 07:40:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:40:00,975 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 846 transitions. [2025-01-09 07:40:00,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 846 transitions. [2025-01-09 07:40:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 07:40:00,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:00,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:00,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 07:40:00,979 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:00,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:00,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1178890609, now seen corresponding path program 1 times [2025-01-09 07:40:00,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:40:00,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198201235] [2025-01-09 07:40:00,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:00,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:40:01,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 07:40:01,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 07:40:01,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:01,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:01,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:40:01,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198201235] [2025-01-09 07:40:01,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198201235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:40:01,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:40:01,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:40:01,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225671961] [2025-01-09 07:40:01,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:40:01,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:40:01,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:40:01,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:40:01,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:40:01,244 INFO L87 Difference]: Start difference. First operand 568 states and 846 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:01,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:40:01,385 INFO L93 Difference]: Finished difference Result 1210 states and 1807 transitions. [2025-01-09 07:40:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:40:01,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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 100 [2025-01-09 07:40:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:40:01,389 INFO L225 Difference]: With dead ends: 1210 [2025-01-09 07:40:01,389 INFO L226 Difference]: Without dead ends: 792 [2025-01-09 07:40:01,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:40:01,390 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 1064 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:40:01,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 3010 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:40:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-01-09 07:40:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 582. [2025-01-09 07:40:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.487091222030981) internal successors, (864), 581 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 864 transitions. [2025-01-09 07:40:01,401 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 864 transitions. Word has length 100 [2025-01-09 07:40:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:40:01,401 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 864 transitions. [2025-01-09 07:40:01,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 864 transitions. [2025-01-09 07:40:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 07:40:01,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:01,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:01,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 07:40:01,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:01,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:01,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1384197002, now seen corresponding path program 1 times [2025-01-09 07:40:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:40:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295214885] [2025-01-09 07:40:01,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:01,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:40:01,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 07:40:01,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 07:40:01,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:01,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:40:01,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 07:40:01,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 07:40:01,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 07:40:01,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:01,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:40:01,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 07:40:01,539 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 07:40:01,539 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 07:40:01,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 07:40:01,542 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:01,614 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 07:40:01,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 07:40:01 BoogieIcfgContainer [2025-01-09 07:40:01,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 07:40:01,624 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 07:40:01,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 07:40:01,624 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 07:40:01,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:39:54" (3/4) ... [2025-01-09 07:40:01,626 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 07:40:01,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 07:40:01,627 INFO L158 Benchmark]: Toolchain (without parser) took 9219.24ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 112.7MB in the beginning and 480.1MB in the end (delta: -367.4MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2025-01-09 07:40:01,627 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:40:01,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.72ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 81.2MB in the end (delta: 31.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 07:40:01,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 150.10ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 46.2MB in the end (delta: 35.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 07:40:01,628 INFO L158 Benchmark]: Boogie Preprocessor took 284.26ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 80.0MB in the end (delta: -33.8MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2025-01-09 07:40:01,628 INFO L158 Benchmark]: RCFGBuilder took 1827.13ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 80.0MB in the beginning and 89.4MB in the end (delta: -9.4MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2025-01-09 07:40:01,628 INFO L158 Benchmark]: TraceAbstraction took 6624.61ms. Allocated memory was 201.3MB in the beginning and 562.0MB in the end (delta: 360.7MB). Free memory was 88.5MB in the beginning and 480.1MB in the end (delta: -391.6MB). Peak memory consumption was 277.4MB. Max. memory is 16.1GB. [2025-01-09 07:40:01,628 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 562.0MB. Free memory is still 480.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:40:01,629 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.25ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.72ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 81.2MB in the end (delta: 31.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 150.10ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 46.2MB in the end (delta: 35.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 284.26ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 80.0MB in the end (delta: -33.8MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1827.13ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 80.0MB in the beginning and 89.4MB in the end (delta: -9.4MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6624.61ms. Allocated memory was 201.3MB in the beginning and 562.0MB in the end (delta: 360.7MB). Free memory was 88.5MB in the beginning and 480.1MB in the end (delta: -391.6MB). Peak memory consumption was 277.4MB. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 562.0MB. Free memory is still 480.1MB. 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 212. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 32); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 64); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (64 - 1); [L35] const SORT_215 mask_SORT_215 = (SORT_215)-1 >> (sizeof(SORT_215) * 8 - 4); [L36] const SORT_215 msb_SORT_215 = (SORT_215)1 << (4 - 1); [L38] const SORT_217 mask_SORT_217 = (SORT_217)-1 >> (sizeof(SORT_217) * 8 - 60); [L39] const SORT_217 msb_SORT_217 = (SORT_217)1 << (60 - 1); [L41] const SORT_10 var_11 = 0; [L42] const SORT_1 var_14 = 0; [L43] const SORT_3 var_24 = 0; [L44] const SORT_1 var_51 = 1; [L45] const SORT_3 var_204 = 1; [L46] const SORT_3 var_208 = 3735928559; [L47] const SORT_3 var_211 = 12245771; [L48] const SORT_215 var_216 = 0; [L50] SORT_1 input_2; [L51] SORT_3 input_4; [L52] SORT_3 input_5; [L53] SORT_1 input_6; [L54] SORT_1 input_7; [L55] SORT_1 input_8; [L56] SORT_1 input_9; [L58] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L58] SORT_10 state_12 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L59] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L60] SORT_10 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L61] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L62] SORT_3 state_25 = __VERIFIER_nondet_uint() & mask_SORT_3; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L63] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L64] SORT_3 state_30 = __VERIFIER_nondet_uint() & mask_SORT_3; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L65] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L66] SORT_3 state_37 = __VERIFIER_nondet_uint() & mask_SORT_3; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L67] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L68] SORT_3 state_42 = __VERIFIER_nondet_uint() & mask_SORT_3; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L69] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L70] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L71] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L72] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L73] SORT_1 state_67 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L74] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L75] SORT_1 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L76] SORT_1 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L77] SORT_1 state_75 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L78] SORT_1 state_77 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L79] SORT_1 state_79 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L80] SORT_1 state_81 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L81] SORT_1 state_83 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L82] SORT_1 state_85 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L83] SORT_1 state_220 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L84] SORT_1 state_251 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L85] SORT_1 state_264 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L86] SORT_1 state_269 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] SORT_10 init_13_arg_1 = var_11; [L89] state_12 = init_13_arg_1 [L90] SORT_1 init_16_arg_1 = var_14; [L91] state_15 = init_16_arg_1 [L92] SORT_10 init_19_arg_1 = var_11; [L93] state_18 = init_19_arg_1 [L94] SORT_1 init_21_arg_1 = var_14; [L95] state_20 = init_21_arg_1 [L96] SORT_3 init_26_arg_1 = var_24; [L97] state_25 = init_26_arg_1 [L98] SORT_1 init_28_arg_1 = var_14; [L99] state_27 = init_28_arg_1 [L100] SORT_3 init_31_arg_1 = var_24; [L101] state_30 = init_31_arg_1 [L102] SORT_1 init_33_arg_1 = var_14; [L103] state_32 = init_33_arg_1 [L104] SORT_3 init_38_arg_1 = var_24; [L105] state_37 = init_38_arg_1 [L106] SORT_1 init_40_arg_1 = var_14; [L107] state_39 = init_40_arg_1 [L108] SORT_3 init_43_arg_1 = var_24; [L109] state_42 = init_43_arg_1 [L110] SORT_1 init_45_arg_1 = var_14; [L111] state_44 = init_45_arg_1 [L112] SORT_1 init_62_arg_1 = var_14; [L113] state_61 = init_62_arg_1 [L114] SORT_1 init_64_arg_1 = var_14; [L115] state_63 = init_64_arg_1 [L116] SORT_1 init_66_arg_1 = var_14; [L117] state_65 = init_66_arg_1 [L118] SORT_1 init_68_arg_1 = var_14; [L119] state_67 = init_68_arg_1 [L120] SORT_1 init_70_arg_1 = var_14; [L121] state_69 = init_70_arg_1 [L122] SORT_1 init_72_arg_1 = var_14; [L123] state_71 = init_72_arg_1 [L124] SORT_1 init_74_arg_1 = var_14; [L125] state_73 = init_74_arg_1 [L126] SORT_1 init_76_arg_1 = var_14; [L127] state_75 = init_76_arg_1 [L128] SORT_1 init_78_arg_1 = var_14; [L129] state_77 = init_78_arg_1 [L130] SORT_1 init_80_arg_1 = var_14; [L131] state_79 = init_80_arg_1 [L132] SORT_1 init_82_arg_1 = var_14; [L133] state_81 = init_82_arg_1 [L134] SORT_1 init_84_arg_1 = var_14; [L135] state_83 = init_84_arg_1 [L136] SORT_1 init_86_arg_1 = var_14; [L137] state_85 = init_86_arg_1 [L138] SORT_1 init_221_arg_1 = var_14; [L139] state_220 = init_221_arg_1 [L140] SORT_1 init_252_arg_1 = var_14; [L141] state_251 = init_252_arg_1 [L142] SORT_1 init_265_arg_1 = var_14; [L143] state_264 = init_265_arg_1 [L144] SORT_1 init_270_arg_1 = var_14; [L145] state_269 = init_270_arg_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L148] input_2 = __VERIFIER_nondet_uchar() [L149] input_4 = __VERIFIER_nondet_uint() [L150] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L150] input_4 = input_4 & mask_SORT_3 [L151] input_5 = __VERIFIER_nondet_uint() [L152] EXPR input_5 & mask_SORT_3 VAL [input_4=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L152] input_5 = input_5 & mask_SORT_3 [L153] input_6 = __VERIFIER_nondet_uchar() [L154] EXPR input_6 & mask_SORT_1 VAL [input_4=0, input_5=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L154] input_6 = input_6 & mask_SORT_1 [L155] input_7 = __VERIFIER_nondet_uchar() [L156] EXPR input_7 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L156] input_7 = input_7 & mask_SORT_1 [L157] input_8 = __VERIFIER_nondet_uchar() [L158] EXPR input_8 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L158] input_8 = input_8 & mask_SORT_1 [L159] input_9 = __VERIFIER_nondet_uchar() [L160] EXPR input_9 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L160] input_9 = input_9 & mask_SORT_1 [L163] SORT_1 var_17_arg_0 = state_15; [L164] SORT_10 var_17_arg_1 = state_12; [L165] SORT_10 var_17_arg_2 = var_11; [L166] SORT_10 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_17=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L167] EXPR var_17 & mask_SORT_10 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L167] var_17 = var_17 & mask_SORT_10 [L168] SORT_1 var_22_arg_0 = state_20; [L169] SORT_10 var_22_arg_1 = state_18; [L170] SORT_10 var_22_arg_2 = var_11; [L171] SORT_10 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_17=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_22=0, var_24=0, var_51=1] [L172] EXPR var_22 & mask_SORT_10 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_17=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L172] var_22 = var_22 & mask_SORT_10 [L173] SORT_10 var_23_arg_0 = var_17; [L174] SORT_10 var_23_arg_1 = var_22; [L175] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L176] SORT_1 var_29_arg_0 = state_27; [L177] SORT_3 var_29_arg_1 = state_25; [L178] SORT_3 var_29_arg_2 = var_24; [L179] SORT_3 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_29=0, var_51=1] [L180] EXPR var_29 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_51=1] [L180] var_29 = var_29 & mask_SORT_3 [L181] SORT_1 var_34_arg_0 = state_32; [L182] SORT_3 var_34_arg_1 = state_30; [L183] SORT_3 var_34_arg_2 = var_24; [L184] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_29=0, var_34=0, var_51=1] [L185] EXPR var_34 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_29=0, var_51=1] [L185] var_34 = var_34 & mask_SORT_3 [L186] SORT_3 var_35_arg_0 = var_29; [L187] SORT_3 var_35_arg_1 = var_34; [L188] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L189] SORT_1 var_36_arg_0 = var_23; [L190] SORT_1 var_36_arg_1 = var_35; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36_arg_0=1, var_36_arg_1=1, var_51=1] [L191] EXPR var_36_arg_0 & var_36_arg_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L191] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L192] SORT_1 var_41_arg_0 = state_39; [L193] SORT_3 var_41_arg_1 = state_37; [L194] SORT_3 var_41_arg_2 = var_24; [L195] SORT_3 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_41=0, var_51=1] [L196] EXPR var_41 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_51=1] [L196] var_41 = var_41 & mask_SORT_3 [L197] SORT_1 var_46_arg_0 = state_44; [L198] SORT_3 var_46_arg_1 = state_42; [L199] SORT_3 var_46_arg_2 = var_24; [L200] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_41=0, var_46=0, var_51=1] [L201] EXPR var_46 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_41=0, var_51=1] [L201] var_46 = var_46 & mask_SORT_3 [L202] SORT_3 var_47_arg_0 = var_41; [L203] SORT_3 var_47_arg_1 = var_46; [L204] SORT_1 var_47 = var_47_arg_0 == var_47_arg_1; [L205] SORT_1 var_48_arg_0 = var_36; [L206] SORT_1 var_48_arg_1 = var_47; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_48_arg_0=1, var_48_arg_1=1, var_51=1] [L207] EXPR var_48_arg_0 & var_48_arg_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L207] SORT_1 var_48 = var_48_arg_0 & var_48_arg_1; [L208] SORT_1 var_52_arg_0 = var_48; [L209] SORT_1 var_52 = ~var_52_arg_0; [L210] SORT_1 var_53_arg_0 = var_51; [L211] SORT_1 var_53_arg_1 = var_52; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1, var_53_arg_0=1, var_53_arg_1=-2] [L212] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L212] SORT_1 var_53 = var_53_arg_0 & var_53_arg_1; [L213] EXPR var_53 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L213] var_53 = var_53 & mask_SORT_1 [L214] SORT_1 bad_54_arg_0 = var_53; [L215] CALL __VERIFIER_assert(!(bad_54_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 523 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6731 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6731 mSDsluCounter, 33011 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24498 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 650 IncrementalHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 8513 mSDtfsCounter, 650 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=582occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 841 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1180 NumberOfCodeBlocks, 1180 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1069 ConstructedInterpolants, 0 QuantifiedInterpolants, 2772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 07:40:01,647 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.mul10.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 37bf2f4a0d13654afdfd5cdecda47a5234857be125596f55f94b7f56efc2af18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:40:03,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:40:03,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 07:40:03,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:40:03,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:40:03,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:40:03,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:40:03,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:40:03,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:40:03,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:40:03,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:40:03,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:40:03,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:40:03,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:40:03,809 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:40:03,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:40:03,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:40:03,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:40:03,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:40:03,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:40:03,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:40:03,809 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 07:40:03,809 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 07:40:03,809 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 07:40:03,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:40:03,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:40:03,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:40:03,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:40:03,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:40:03,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:40:03,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:40:03,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:40:03,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:40:03,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:40:03,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:40:03,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:40:03,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:40:03,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:40:03,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:40:03,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:40:03,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:40:03,811 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 07:40:03,811 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 07:40:03,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:40:03,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:40:03,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:40:03,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:40:03,811 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 -> 37bf2f4a0d13654afdfd5cdecda47a5234857be125596f55f94b7f56efc2af18 [2025-01-09 07:40:04,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:40:04,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:40:04,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:40:04,083 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:40:04,083 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:40:04,086 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.mul10.c [2025-01-09 07:40:05,304 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/360a0a746/aaa0a148ff4b472798ee86790dbfe419/FLAG06001f347 [2025-01-09 07:40:05,559 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:40:05,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul10.c [2025-01-09 07:40:05,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/360a0a746/aaa0a148ff4b472798ee86790dbfe419/FLAG06001f347 [2025-01-09 07:40:05,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/360a0a746/aaa0a148ff4b472798ee86790dbfe419 [2025-01-09 07:40:05,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:40:05,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:40:05,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:40:05,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:40:05,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:40:05,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:05,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4d39f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05, skipping insertion in model container [2025-01-09 07:40:05,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:05,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:40:05,730 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.mul10.c[1245,1258] [2025-01-09 07:40:05,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:40:05,890 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:40:05,900 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.mul10.c[1245,1258] [2025-01-09 07:40:05,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:40:05,984 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:40:05,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05 WrapperNode [2025-01-09 07:40:05,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:40:05,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:40:05,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:40:05,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:40:05,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,057 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 736 [2025-01-09 07:40:06,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:40:06,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:40:06,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:40:06,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:40:06,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,106 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-01-09 07:40:06,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,129 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:40:06,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:40:06,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:40:06,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:40:06,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (1/1) ... [2025-01-09 07:40:06,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:40:06,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:40:06,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:40:06,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:40:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:40:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 07:40:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 07:40:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:40:06,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:40:06,347 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:40:06,349 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:40:07,123 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-01-09 07:40:07,123 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:40:07,132 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:40:07,132 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:40:07,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:40:07 BoogieIcfgContainer [2025-01-09 07:40:07,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:40:07,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:40:07,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:40:07,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:40:07,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:40:05" (1/3) ... [2025-01-09 07:40:07,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d109081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:40:07, skipping insertion in model container [2025-01-09 07:40:07,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:40:05" (2/3) ... [2025-01-09 07:40:07,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d109081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:40:07, skipping insertion in model container [2025-01-09 07:40:07,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:40:07" (3/3) ... [2025-01-09 07:40:07,142 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul10.c [2025-01-09 07:40:07,153 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:40:07,155 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul10.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:40:07,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:40:07,208 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;@61da8b76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:40:07,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:40:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 07:40:07,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:07,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 07:40:07,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:07,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 07:40:07,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:40:07,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100551528] [2025-01-09 07:40:07,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:07,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:40:07,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:40:07,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:40:07,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 07:40:07,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 07:40:07,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 07:40:07,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:07,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:07,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 07:40:07,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:40:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:07,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:40:07,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 07:40:07,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100551528] [2025-01-09 07:40:07,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100551528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:40:07,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:40:07,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:40:07,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690076888] [2025-01-09 07:40:07,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:40:07,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:40:07,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 07:40:07,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:40:07,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:40:07,875 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:40:08,061 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-01-09 07:40:08,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:40:08,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 07:40:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:40:08,072 INFO L225 Difference]: With dead ends: 17 [2025-01-09 07:40:08,072 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 07:40:08,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:40:08,076 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:40:08,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:40:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 07:40:08,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-01-09 07:40:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 07:40:08,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 07:40:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:40:08,099 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 07:40:08,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:40:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 07:40:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 07:40:08,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:40:08,100 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 07:40:08,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 07:40:08,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:40:08,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:40:08,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:40:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 07:40:08,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:40:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744559083] [2025-01-09 07:40:08,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:40:08,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:40:08,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:40:08,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:40:08,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 07:40:08,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 07:40:08,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 07:40:08,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:40:08,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:40:08,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-01-09 07:40:08,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:40:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:40:09,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 07:40:25,981 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse16 (= |c_ULTIMATE.start_main_~state_269~0#1| (_ bv0 8))) (.cse38 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |c_ULTIMATE.start_main_~state_42~0#1|))) (let ((.cse35 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 32))) (not (= .cse38 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_5~0#1|))))) (.cse13 (not .cse16)) (.cse36 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) (.cse12 (= |c_ULTIMATE.start_main_~state_251~0#1| (_ bv0 8))) (.cse25 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse37 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))))) (let ((.cse20 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse14 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))))) (.cse27 (or .cse25 .cse37)) (.cse8 (not .cse12)) (.cse26 (or .cse16 .cse36 .cse25)) (.cse34 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse11 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) .cse13)) (.cse32 (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 32))) (= .cse38 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_5~0#1|))) .cse25)) (.cse33 (or .cse35 .cse25))) (let ((.cse10 (and .cse32 .cse33)) (.cse28 (and (or .cse12 (and (or .cse16 (and .cse34 .cse25)) (or .cse13 (and (or .cse14 .cse34) .cse27)))) (or .cse8 (and .cse26 (or .cse34 .cse11))))) (.cse24 (not .cse20))) (let ((.cse29 (or .cse28 .cse24)) (.cse6 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse15 (or .cse37 .cse10)) (.cse9 (or .cse16 .cse36 .cse10))) (let ((.cse18 (let ((.cse31 (or .cse34 .cse35))) (let ((.cse30 (and .cse31 .cse32))) (and (or .cse12 (and (or .cse13 (and .cse15 (or .cse14 .cse30))) (or .cse16 (and .cse31 .cse32 .cse33)))) (or .cse8 (and .cse9 (or .cse30 .cse11))))))) (.cse5 (not .cse6)) (.cse23 (and .cse29 (or .cse20 .cse28))) (.cse17 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_9| (_ BitVec 32))) (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_4~0#1|) (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~state_30~0#1_9|)))) (.cse19 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_9| (_ BitVec 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_4~0#1|) (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~state_30~0#1_9|)))))) (let ((.cse0 (and (or .cse20 (and (or .cse17 (and (or (and (or .cse25 .cse11) .cse26) .cse8) (or .cse12 (and (or .cse13 (and (or .cse14 .cse25) .cse27)) (or .cse16 .cse25))))) (or .cse28 .cse19))) .cse29)) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse22 (or .cse5 .cse23)) (.cse7 (or .cse18 .cse24))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 .cse2))) .cse3))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse2 .cse4))))))))))) (or (and (or .cse5 .cse0) (or .cse6 (and .cse7 (or (and (or (and (or .cse8 (and .cse9 (or .cse10 .cse11))) (or .cse12 (and (or .cse13 (and (or .cse14 .cse10) .cse15)) (or .cse16 .cse10)))) .cse17) (or .cse18 .cse19)) .cse20)))) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 .cse21))) .cse3)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse21 .cse4))))))))))) (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse3)))) (and .cse22 (or .cse6 .cse23))) (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse3))))) (and .cse22 (or .cse6 (and .cse7 (or .cse18 .cse20))))))))))))) is different from false