./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:06:15,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:06:15,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:06:15,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:06:15,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:06:15,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:06:15,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:06:15,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:06:15,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:06:15,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:06:15,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:06:15,209 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:06:15,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:06:15,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:06:15,210 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:06:15,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:06:15,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:06:15,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:06:15,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:06:15,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:06:15,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:06:15,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:06:15,213 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:06:15,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:06:15,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:06:15,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:06:15,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:06:15,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:06:15,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:06:15,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:06:15,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:06:15,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:06:15,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:06:15,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:06:15,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:06:15,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:06:15,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:06:15,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:06:15,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:06:15,226 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 [2024-11-12 00:06:15,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:06:15,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:06:15,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:06:15,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:06:15,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:06:15,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-11-12 00:06:17,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:06:17,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:06:17,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-11-12 00:06:17,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992f5bcb5/d208289eee314e178684da2700dc726b/FLAG0644c7e74 [2024-11-12 00:06:17,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992f5bcb5/d208289eee314e178684da2700dc726b [2024-11-12 00:06:17,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:06:17,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:06:17,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:06:17,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:06:17,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:06:17,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:06:17" (1/1) ... [2024-11-12 00:06:17,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aea1c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:17, skipping insertion in model container [2024-11-12 00:06:17,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:06:17" (1/1) ... [2024-11-12 00:06:17,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:06:17,880 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c[1245,1258] [2024-11-12 00:06:18,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:06:18,206 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:06:18,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c[1245,1258] [2024-11-12 00:06:18,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:06:18,332 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:06:18,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18 WrapperNode [2024-11-12 00:06:18,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:06:18,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:06:18,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:06:18,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:06:18,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (1/1) ... [2024-11-12 00:06:18,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (1/1) ... [2024-11-12 00:06:18,641 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1909 [2024-11-12 00:06:18,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:06:18,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:06:18,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:06:18,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:06:18,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (1/1) ... [2024-11-12 00:06:18,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (1/1) ... [2024-11-12 00:06:18,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (1/1) ... [2024-11-12 00:06:18,763 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]. [2024-11-12 00:06:18,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (1/1) ... [2024-11-12 00:06:18,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (1/1) ... [2024-11-12 00:06:18,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (1/1) ... [2024-11-12 00:06:18,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (1/1) ... [2024-11-12 00:06:18,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (1/1) ... [2024-11-12 00:06:18,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (1/1) ... [2024-11-12 00:06:18,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:06:18,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:06:18,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:06:18,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:06:18,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (1/1) ... [2024-11-12 00:06:18,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:06:18,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:06:18,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:06:18,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:06:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:06:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:06:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 00:06:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:06:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:06:19,392 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:06:19,395 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:06:21,272 INFO L? ?]: Removed 1250 outVars from TransFormulas that were not future-live. [2024-11-12 00:06:21,272 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:06:21,294 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:06:21,294 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:06:21,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:06:21 BoogieIcfgContainer [2024-11-12 00:06:21,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:06:21,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:06:21,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:06:21,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:06:21,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:06:17" (1/3) ... [2024-11-12 00:06:21,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea3681d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:06:21, skipping insertion in model container [2024-11-12 00:06:21,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:18" (2/3) ... [2024-11-12 00:06:21,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea3681d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:06:21, skipping insertion in model container [2024-11-12 00:06:21,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:06:21" (3/3) ... [2024-11-12 00:06:21,306 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b03.c [2024-11-12 00:06:21,325 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:06:21,326 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:06:21,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:06:21,422 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;@4f6eabf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:06:21,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:06:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 184 states have (on average 1.4945652173913044) internal successors, (275), 185 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-12 00:06:21,442 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:21,443 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] [2024-11-12 00:06:21,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:21,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:21,450 INFO L85 PathProgramCache]: Analyzing trace with hash 109545984, now seen corresponding path program 1 times [2024-11-12 00:06:21,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:21,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377880810] [2024-11-12 00:06:21,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:21,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:22,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:22,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377880810] [2024-11-12 00:06:22,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377880810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:22,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:22,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:06:22,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072322902] [2024-11-12 00:06:22,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:22,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:06:22,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:22,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:06:22,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:06:22,485 INFO L87 Difference]: Start difference. First operand has 186 states, 184 states have (on average 1.4945652173913044) internal successors, (275), 185 states have internal predecessors, (275), 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 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:22,566 INFO L93 Difference]: Finished difference Result 309 states and 459 transitions. [2024-11-12 00:06:22,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:06:22,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-12 00:06:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:22,579 INFO L225 Difference]: With dead ends: 309 [2024-11-12 00:06:22,580 INFO L226 Difference]: Without dead ends: 185 [2024-11-12 00:06:22,583 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 [2024-11-12 00:06:22,586 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:22,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 801 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:06:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-12 00:06:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-12 00:06:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.483695652173913) internal successors, (273), 184 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 273 transitions. [2024-11-12 00:06:22,632 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 273 transitions. Word has length 57 [2024-11-12 00:06:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:22,633 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 273 transitions. [2024-11-12 00:06:22,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 273 transitions. [2024-11-12 00:06:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 00:06:22,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:22,637 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] [2024-11-12 00:06:22,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:06:22,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:22,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:22,639 INFO L85 PathProgramCache]: Analyzing trace with hash -897346301, now seen corresponding path program 1 times [2024-11-12 00:06:22,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:22,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424988531] [2024-11-12 00:06:22,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:22,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:22,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:22,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424988531] [2024-11-12 00:06:22,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424988531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:22,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:23,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:06:23,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870997540] [2024-11-12 00:06:23,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:23,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:06:23,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:23,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:06:23,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:06:23,005 INFO L87 Difference]: Start difference. First operand 185 states and 273 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:23,075 INFO L93 Difference]: Finished difference Result 310 states and 457 transitions. [2024-11-12 00:06:23,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:06:23,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2024-11-12 00:06:23,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:23,078 INFO L225 Difference]: With dead ends: 310 [2024-11-12 00:06:23,079 INFO L226 Difference]: Without dead ends: 187 [2024-11-12 00:06:23,079 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 [2024-11-12 00:06:23,081 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:23,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 797 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:06:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-12 00:06:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-12 00:06:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.478494623655914) internal successors, (275), 186 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 275 transitions. [2024-11-12 00:06:23,094 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 275 transitions. Word has length 58 [2024-11-12 00:06:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:23,095 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 275 transitions. [2024-11-12 00:06:23,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 275 transitions. [2024-11-12 00:06:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 00:06:23,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:23,097 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] [2024-11-12 00:06:23,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:06:23,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:23,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1149070137, now seen corresponding path program 1 times [2024-11-12 00:06:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127392671] [2024-11-12 00:06:23,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:24,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:24,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127392671] [2024-11-12 00:06:24,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127392671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:24,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:24,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:06:24,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662076438] [2024-11-12 00:06:24,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:24,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:06:24,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:24,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:06:24,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:06:24,162 INFO L87 Difference]: Start difference. First operand 187 states and 275 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:24,340 INFO L93 Difference]: Finished difference Result 319 states and 469 transitions. [2024-11-12 00:06:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:06:24,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 59 [2024-11-12 00:06:24,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:24,347 INFO L225 Difference]: With dead ends: 319 [2024-11-12 00:06:24,348 INFO L226 Difference]: Without dead ends: 194 [2024-11-12 00:06:24,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:06:24,351 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 233 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:24,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1301 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:06:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-12 00:06:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2024-11-12 00:06:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.46875) internal successors, (282), 192 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 282 transitions. [2024-11-12 00:06:24,385 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 282 transitions. Word has length 59 [2024-11-12 00:06:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:24,386 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 282 transitions. [2024-11-12 00:06:24,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 282 transitions. [2024-11-12 00:06:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 00:06:24,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:24,392 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] [2024-11-12 00:06:24,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:06:24,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:24,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1468985978, now seen corresponding path program 1 times [2024-11-12 00:06:24,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:24,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955301489] [2024-11-12 00:06:24,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:24,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:26,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:26,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955301489] [2024-11-12 00:06:26,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955301489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:26,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:26,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 00:06:26,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744633250] [2024-11-12 00:06:26,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:26,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 00:06:26,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 00:06:26,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-11-12 00:06:26,190 INFO L87 Difference]: Start difference. First operand 193 states and 282 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:26,744 INFO L93 Difference]: Finished difference Result 354 states and 516 transitions. [2024-11-12 00:06:26,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 00:06:26,745 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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 60 [2024-11-12 00:06:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:26,746 INFO L225 Difference]: With dead ends: 354 [2024-11-12 00:06:26,747 INFO L226 Difference]: Without dead ends: 223 [2024-11-12 00:06:26,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2024-11-12 00:06:26,751 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 303 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:26,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 3455 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:06:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-12 00:06:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2024-11-12 00:06:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4722222222222223) internal successors, (318), 216 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 318 transitions. [2024-11-12 00:06:26,768 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 318 transitions. Word has length 60 [2024-11-12 00:06:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:26,768 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 318 transitions. [2024-11-12 00:06:26,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 318 transitions. [2024-11-12 00:06:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 00:06:26,771 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:26,771 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] [2024-11-12 00:06:26,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:06:26,771 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:26,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:26,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2124644278, now seen corresponding path program 1 times [2024-11-12 00:06:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:26,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881803458] [2024-11-12 00:06:26,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:26,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:27,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881803458] [2024-11-12 00:06:27,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881803458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:27,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:27,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:06:27,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413171220] [2024-11-12 00:06:27,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:27,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:06:27,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:27,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:06:27,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:06:27,375 INFO L87 Difference]: Start difference. First operand 217 states and 318 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:27,502 INFO L93 Difference]: Finished difference Result 391 states and 571 transitions. [2024-11-12 00:06:27,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:06:27,503 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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 60 [2024-11-12 00:06:27,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:27,504 INFO L225 Difference]: With dead ends: 391 [2024-11-12 00:06:27,504 INFO L226 Difference]: Without dead ends: 236 [2024-11-12 00:06:27,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:06:27,506 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 243 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1777 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 [2024-11-12 00:06:27,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1777 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:06:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-12 00:06:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 231. [2024-11-12 00:06:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4695652173913043) internal successors, (338), 230 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 338 transitions. [2024-11-12 00:06:27,517 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 338 transitions. Word has length 60 [2024-11-12 00:06:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:27,518 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 338 transitions. [2024-11-12 00:06:27,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 338 transitions. [2024-11-12 00:06:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 00:06:27,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:27,520 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] [2024-11-12 00:06:27,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:06:27,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:27,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1979474159, now seen corresponding path program 1 times [2024-11-12 00:06:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:27,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48000915] [2024-11-12 00:06:27,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:27,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:27,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:27,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48000915] [2024-11-12 00:06:27,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48000915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:27,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:27,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:06:27,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622925062] [2024-11-12 00:06:27,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:27,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:06:27,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:27,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:06:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:06:27,757 INFO L87 Difference]: Start difference. First operand 231 states and 338 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:27,831 INFO L93 Difference]: Finished difference Result 486 states and 705 transitions. [2024-11-12 00:06:27,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:06:27,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 60 [2024-11-12 00:06:27,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:27,834 INFO L225 Difference]: With dead ends: 486 [2024-11-12 00:06:27,836 INFO L226 Difference]: Without dead ends: 317 [2024-11-12 00:06:27,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:06:27,842 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 355 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:27,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 780 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:06:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-12 00:06:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 287. [2024-11-12 00:06:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.465034965034965) internal successors, (419), 286 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 419 transitions. [2024-11-12 00:06:27,871 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 419 transitions. Word has length 60 [2024-11-12 00:06:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:27,871 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 419 transitions. [2024-11-12 00:06:27,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 419 transitions. [2024-11-12 00:06:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-12 00:06:27,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:27,874 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] [2024-11-12 00:06:27,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:06:27,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:27,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:27,878 INFO L85 PathProgramCache]: Analyzing trace with hash 125082261, now seen corresponding path program 1 times [2024-11-12 00:06:27,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:27,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280316176] [2024-11-12 00:06:27,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:27,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:28,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:28,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280316176] [2024-11-12 00:06:28,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280316176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:28,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:06:28,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368784331] [2024-11-12 00:06:28,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:28,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:06:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:28,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:06:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:06:28,420 INFO L87 Difference]: Start difference. First operand 287 states and 419 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:28,533 INFO L93 Difference]: Finished difference Result 487 states and 709 transitions. [2024-11-12 00:06:28,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:06:28,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 61 [2024-11-12 00:06:28,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:28,535 INFO L225 Difference]: With dead ends: 487 [2024-11-12 00:06:28,536 INFO L226 Difference]: Without dead ends: 311 [2024-11-12 00:06:28,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:06:28,537 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 244 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:28,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1568 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:06:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-12 00:06:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-11-12 00:06:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 1.4451612903225806) internal successors, (448), 310 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 448 transitions. [2024-11-12 00:06:28,549 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 448 transitions. Word has length 61 [2024-11-12 00:06:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:28,550 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 448 transitions. [2024-11-12 00:06:28,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 448 transitions. [2024-11-12 00:06:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-12 00:06:28,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:28,554 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] [2024-11-12 00:06:28,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:06:28,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:28,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:28,555 INFO L85 PathProgramCache]: Analyzing trace with hash -594321589, now seen corresponding path program 1 times [2024-11-12 00:06:28,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:28,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932426805] [2024-11-12 00:06:28,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:29,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:29,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932426805] [2024-11-12 00:06:29,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932426805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:29,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:29,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:06:29,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887674693] [2024-11-12 00:06:29,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:29,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:06:29,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:29,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:06:29,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:06:29,037 INFO L87 Difference]: Start difference. First operand 311 states and 448 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:29,142 INFO L93 Difference]: Finished difference Result 560 states and 805 transitions. [2024-11-12 00:06:29,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:06:29,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 61 [2024-11-12 00:06:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:29,144 INFO L225 Difference]: With dead ends: 560 [2024-11-12 00:06:29,145 INFO L226 Difference]: Without dead ends: 351 [2024-11-12 00:06:29,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:06:29,146 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 248 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:29,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1567 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:06:29,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-12 00:06:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-12 00:06:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 1.4257142857142857) internal successors, (499), 350 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 499 transitions. [2024-11-12 00:06:29,156 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 499 transitions. Word has length 61 [2024-11-12 00:06:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:29,156 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 499 transitions. [2024-11-12 00:06:29,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 499 transitions. [2024-11-12 00:06:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-12 00:06:29,157 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:29,157 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] [2024-11-12 00:06:29,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 00:06:29,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:29,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:29,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1321086045, now seen corresponding path program 1 times [2024-11-12 00:06:29,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:29,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022962405] [2024-11-12 00:06:29,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:29,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:29,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:29,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022962405] [2024-11-12 00:06:29,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022962405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:29,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:29,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:06:29,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681502918] [2024-11-12 00:06:29,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:29,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:06:29,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:29,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:06:29,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:06:29,374 INFO L87 Difference]: Start difference. First operand 351 states and 499 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:29,444 INFO L93 Difference]: Finished difference Result 640 states and 897 transitions. [2024-11-12 00:06:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:06:29,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 61 [2024-11-12 00:06:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:29,449 INFO L225 Difference]: With dead ends: 640 [2024-11-12 00:06:29,449 INFO L226 Difference]: Without dead ends: 374 [2024-11-12 00:06:29,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:06:29,451 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 361 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:29,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 780 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:06:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-12 00:06:29,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 342. [2024-11-12 00:06:29,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 1.4193548387096775) internal successors, (484), 341 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 484 transitions. [2024-11-12 00:06:29,466 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 484 transitions. Word has length 61 [2024-11-12 00:06:29,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:29,467 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 484 transitions. [2024-11-12 00:06:29,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 484 transitions. [2024-11-12 00:06:29,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 00:06:29,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:29,468 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] [2024-11-12 00:06:29,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 00:06:29,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:29,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:29,470 INFO L85 PathProgramCache]: Analyzing trace with hash -597014213, now seen corresponding path program 1 times [2024-11-12 00:06:29,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:29,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319191856] [2024-11-12 00:06:29,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:29,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:29,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319191856] [2024-11-12 00:06:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319191856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:29,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:29,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:06:29,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361422363] [2024-11-12 00:06:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:06:29,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:29,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:06:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:06:29,673 INFO L87 Difference]: Start difference. First operand 342 states and 484 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:29,747 INFO L93 Difference]: Finished difference Result 579 states and 813 transitions. [2024-11-12 00:06:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:06:29,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 62 [2024-11-12 00:06:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:29,750 INFO L225 Difference]: With dead ends: 579 [2024-11-12 00:06:29,751 INFO L226 Difference]: Without dead ends: 344 [2024-11-12 00:06:29,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:06:29,753 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 339 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:29,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 780 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:06:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-12 00:06:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 317. [2024-11-12 00:06:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.4145569620253164) internal successors, (447), 316 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 447 transitions. [2024-11-12 00:06:29,769 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 447 transitions. Word has length 62 [2024-11-12 00:06:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:29,770 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 447 transitions. [2024-11-12 00:06:29,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 447 transitions. [2024-11-12 00:06:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 00:06:29,773 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:29,773 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] [2024-11-12 00:06:29,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 00:06:29,774 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:29,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:29,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1768191416, now seen corresponding path program 1 times [2024-11-12 00:06:29,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:29,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260992315] [2024-11-12 00:06:29,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:30,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260992315] [2024-11-12 00:06:30,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260992315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:30,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:30,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:06:30,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604881912] [2024-11-12 00:06:30,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:30,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:06:30,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:30,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:06:30,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:06:30,491 INFO L87 Difference]: Start difference. First operand 317 states and 447 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:30,621 INFO L93 Difference]: Finished difference Result 588 states and 828 transitions. [2024-11-12 00:06:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:06:30,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 62 [2024-11-12 00:06:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:30,625 INFO L225 Difference]: With dead ends: 588 [2024-11-12 00:06:30,625 INFO L226 Difference]: Without dead ends: 348 [2024-11-12 00:06:30,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:06:30,627 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 252 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:30,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1567 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:06:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-12 00:06:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-11-12 00:06:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.4005763688760806) internal successors, (486), 347 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 486 transitions. [2024-11-12 00:06:30,637 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 486 transitions. Word has length 62 [2024-11-12 00:06:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:30,637 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 486 transitions. [2024-11-12 00:06:30,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 486 transitions. [2024-11-12 00:06:30,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 00:06:30,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:30,638 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] [2024-11-12 00:06:30,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 00:06:30,639 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:30,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1744500801, now seen corresponding path program 1 times [2024-11-12 00:06:30,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:30,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258812183] [2024-11-12 00:06:30,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:30,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:30,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258812183] [2024-11-12 00:06:30,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258812183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:30,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:30,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:06:30,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596412123] [2024-11-12 00:06:30,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:30,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:06:30,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:30,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:06:30,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:06:30,861 INFO L87 Difference]: Start difference. First operand 348 states and 486 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:30,931 INFO L93 Difference]: Finished difference Result 610 states and 845 transitions. [2024-11-12 00:06:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:06:30,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 62 [2024-11-12 00:06:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:30,933 INFO L225 Difference]: With dead ends: 610 [2024-11-12 00:06:30,933 INFO L226 Difference]: Without dead ends: 350 [2024-11-12 00:06:30,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:06:30,934 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 331 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:30,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 780 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:06:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-12 00:06:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 325. [2024-11-12 00:06:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.3981481481481481) internal successors, (453), 324 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 453 transitions. [2024-11-12 00:06:30,944 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 453 transitions. Word has length 62 [2024-11-12 00:06:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:30,944 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 453 transitions. [2024-11-12 00:06:30,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 453 transitions. [2024-11-12 00:06:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 00:06:30,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:30,946 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] [2024-11-12 00:06:30,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 00:06:30,946 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:30,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:30,947 INFO L85 PathProgramCache]: Analyzing trace with hash 736704605, now seen corresponding path program 1 times [2024-11-12 00:06:30,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:30,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005720041] [2024-11-12 00:06:30,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:30,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:31,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005720041] [2024-11-12 00:06:31,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005720041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:31,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:31,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 00:06:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888614651] [2024-11-12 00:06:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:31,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 00:06:31,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:31,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 00:06:31,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-12 00:06:31,716 INFO L87 Difference]: Start difference. First operand 325 states and 453 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:32,063 INFO L93 Difference]: Finished difference Result 610 states and 851 transitions. [2024-11-12 00:06:32,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 00:06:32,064 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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 63 [2024-11-12 00:06:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:32,066 INFO L225 Difference]: With dead ends: 610 [2024-11-12 00:06:32,066 INFO L226 Difference]: Without dead ends: 382 [2024-11-12 00:06:32,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-12 00:06:32,068 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 249 mSDsluCounter, 3401 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 3667 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:32,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 3667 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:06:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-12 00:06:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 365. [2024-11-12 00:06:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.3928571428571428) internal successors, (507), 364 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 507 transitions. [2024-11-12 00:06:32,081 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 507 transitions. Word has length 63 [2024-11-12 00:06:32,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:32,081 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 507 transitions. [2024-11-12 00:06:32,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:32,082 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 507 transitions. [2024-11-12 00:06:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 00:06:32,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:32,083 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] [2024-11-12 00:06:32,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 00:06:32,083 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:32,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:32,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1355141814, now seen corresponding path program 1 times [2024-11-12 00:06:32,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:32,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849586639] [2024-11-12 00:06:32,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:32,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:32,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:06:32,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849586639] [2024-11-12 00:06:32,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849586639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:32,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:32,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:06:32,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666867460] [2024-11-12 00:06:32,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:32,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:06:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:06:32,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:06:32,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:06:32,283 INFO L87 Difference]: Start difference. First operand 365 states and 507 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:32,350 INFO L93 Difference]: Finished difference Result 651 states and 902 transitions. [2024-11-12 00:06:32,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:06:32,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2024-11-12 00:06:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:32,353 INFO L225 Difference]: With dead ends: 651 [2024-11-12 00:06:32,353 INFO L226 Difference]: Without dead ends: 355 [2024-11-12 00:06:32,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:06:32,354 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 311 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:32,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 780 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:06:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-12 00:06:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 337. [2024-11-12 00:06:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.4107142857142858) internal successors, (474), 336 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 474 transitions. [2024-11-12 00:06:32,364 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 474 transitions. Word has length 63 [2024-11-12 00:06:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:32,364 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 474 transitions. [2024-11-12 00:06:32,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 474 transitions. [2024-11-12 00:06:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 00:06:32,365 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:32,365 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] [2024-11-12 00:06:32,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 00:06:32,366 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:32,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1367415582, now seen corresponding path program 1 times [2024-11-12 00:06:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:06:32,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186769350] [2024-11-12 00:06:32,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:32,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:06:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:06:32,454 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 00:06:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:06:32,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 00:06:32,571 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 00:06:32,572 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 00:06:32,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 00:06:32,578 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:06:32,687 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 00:06:32,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:06:32 BoogieIcfgContainer [2024-11-12 00:06:32,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 00:06:32,691 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 00:06:32,691 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 00:06:32,691 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 00:06:32,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:06:21" (3/4) ... [2024-11-12 00:06:32,694 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 00:06:32,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 00:06:32,696 INFO L158 Benchmark]: Toolchain (without parser) took 15120.15ms. Allocated memory was 165.7MB in the beginning and 570.4MB in the end (delta: 404.8MB). Free memory was 130.4MB in the beginning and 282.6MB in the end (delta: -152.1MB). Peak memory consumption was 253.1MB. Max. memory is 16.1GB. [2024-11-12 00:06:32,696 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 165.7MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:06:32,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 756.82ms. Allocated memory is still 165.7MB. Free memory was 130.4MB in the beginning and 80.2MB in the end (delta: 50.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-12 00:06:32,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 307.16ms. Allocated memory is still 165.7MB. Free memory was 80.2MB in the beginning and 105.5MB in the end (delta: -25.3MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-12 00:06:32,696 INFO L158 Benchmark]: Boogie Preprocessor took 273.69ms. Allocated memory is still 165.7MB. Free memory was 104.5MB in the beginning and 81.3MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 00:06:32,697 INFO L158 Benchmark]: RCFGBuilder took 2377.58ms. Allocated memory was 165.7MB in the beginning and 213.9MB in the end (delta: 48.2MB). Free memory was 81.3MB in the beginning and 109.8MB in the end (delta: -28.4MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2024-11-12 00:06:32,697 INFO L158 Benchmark]: TraceAbstraction took 11392.78ms. Allocated memory was 213.9MB in the beginning and 570.4MB in the end (delta: 356.5MB). Free memory was 108.7MB in the beginning and 282.6MB in the end (delta: -173.9MB). Peak memory consumption was 182.6MB. Max. memory is 16.1GB. [2024-11-12 00:06:32,697 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 570.4MB. Free memory is still 282.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:06:32,698 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.24ms. Allocated memory is still 165.7MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 756.82ms. Allocated memory is still 165.7MB. Free memory was 130.4MB in the beginning and 80.2MB in the end (delta: 50.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 307.16ms. Allocated memory is still 165.7MB. Free memory was 80.2MB in the beginning and 105.5MB in the end (delta: -25.3MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 273.69ms. Allocated memory is still 165.7MB. Free memory was 104.5MB in the beginning and 81.3MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2377.58ms. Allocated memory was 165.7MB in the beginning and 213.9MB in the end (delta: 48.2MB). Free memory was 81.3MB in the beginning and 109.8MB in the end (delta: -28.4MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11392.78ms. Allocated memory was 213.9MB in the beginning and 570.4MB in the end (delta: 356.5MB). Free memory was 108.7MB in the beginning and 282.6MB in the end (delta: -173.9MB). Peak memory consumption was 182.6MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 570.4MB. Free memory is still 282.6MB. 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 375. 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_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 4); [L30] const SORT_7 msb_SORT_7 = (SORT_7)1 << (4 - 1); [L32] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 32); [L33] const SORT_11 msb_SORT_11 = (SORT_11)1 << (32 - 1); [L35] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 3); [L36] const SORT_37 msb_SORT_37 = (SORT_37)1 << (3 - 1); [L38] const SORT_67 mask_SORT_67 = (SORT_67)-1 >> (sizeof(SORT_67) * 8 - 2); [L39] const SORT_67 msb_SORT_67 = (SORT_67)1 << (2 - 1); [L41] const SORT_7 var_8 = 0; [L42] const SORT_11 var_13 = 0; [L43] const SORT_11 var_16 = 8; [L44] const SORT_11 var_20 = 4; [L45] const SORT_11 var_24 = 2; [L46] const SORT_11 var_28 = 1; [L47] const SORT_1 var_33 = 1; [L48] const SORT_37 var_38 = 0; [L49] const SORT_1 var_47 = 0; [L50] const SORT_67 var_68 = 0; [L51] const SORT_67 var_71 = 1; [L52] const SORT_37 var_81 = 7; [L53] const SORT_37 var_104 = 1; [L54] const SORT_37 var_123 = 2; [L55] const SORT_37 var_138 = 4; [L56] const SORT_67 var_154 = 2; [L57] const SORT_7 var_394 = 8; [L58] const SORT_7 var_397 = 4; [L59] const SORT_7 var_400 = 2; [L60] const SORT_7 var_401 = 1; [L62] SORT_1 input_2; [L63] SORT_1 input_3; [L64] SORT_1 input_4; [L65] SORT_1 input_5; [L66] SORT_1 input_6; [L67] SORT_37 input_75; [L68] SORT_37 input_76; [L69] SORT_37 input_77; [L70] SORT_37 input_78; [L71] SORT_37 input_79; [L72] SORT_37 input_80; [L73] SORT_37 input_85; [L74] SORT_37 input_87; [L75] SORT_37 input_89; [L76] SORT_37 input_94; [L77] SORT_37 input_96; [L78] SORT_37 input_98; [L79] SORT_37 input_102; [L80] SORT_37 input_103; [L81] SORT_37 input_108; [L82] SORT_37 input_110; [L83] SORT_37 input_115; [L84] SORT_37 input_117; [L85] SORT_37 input_121; [L86] SORT_37 input_122; [L87] SORT_37 input_127; [L88] SORT_37 input_132; [L89] SORT_37 input_136; [L90] SORT_37 input_137; [L91] SORT_37 input_149; [L92] SORT_37 input_160; [L93] SORT_37 input_161; [L94] SORT_37 input_162; [L95] SORT_37 input_163; [L96] SORT_37 input_164; [L97] SORT_37 input_165; [L98] SORT_37 input_168; [L99] SORT_37 input_170; [L100] SORT_37 input_172; [L101] SORT_37 input_177; [L102] SORT_37 input_179; [L103] SORT_37 input_181; [L104] SORT_37 input_185; [L105] SORT_37 input_186; [L106] SORT_37 input_189; [L107] SORT_37 input_191; [L108] SORT_37 input_196; [L109] SORT_37 input_198; [L110] SORT_37 input_202; [L111] SORT_37 input_203; [L112] SORT_37 input_206; [L113] SORT_37 input_211; [L114] SORT_37 input_215; [L115] SORT_37 input_216; [L116] SORT_37 input_226; [L117] SORT_37 input_233; [L118] SORT_37 input_234; [L119] SORT_37 input_235; [L120] SORT_37 input_236; [L121] SORT_37 input_237; [L122] SORT_37 input_238; [L123] SORT_37 input_241; [L124] SORT_37 input_243; [L125] SORT_37 input_245; [L126] SORT_37 input_250; [L127] SORT_37 input_252; [L128] SORT_37 input_254; [L129] SORT_37 input_258; [L130] SORT_37 input_259; [L131] SORT_37 input_262; [L132] SORT_37 input_264; [L133] SORT_37 input_269; [L134] SORT_37 input_271; [L135] SORT_37 input_275; [L136] SORT_37 input_276; [L137] SORT_37 input_279; [L138] SORT_37 input_284; [L139] SORT_37 input_288; [L140] SORT_37 input_289; [L141] SORT_37 input_299; [L142] SORT_37 input_306; [L143] SORT_37 input_307; [L144] SORT_37 input_308; [L145] SORT_37 input_309; [L146] SORT_37 input_310; [L147] SORT_37 input_311; [L148] SORT_37 input_314; [L149] SORT_37 input_316; [L150] SORT_37 input_318; [L151] SORT_37 input_323; [L152] SORT_37 input_325; [L153] SORT_37 input_327; [L154] SORT_37 input_331; [L155] SORT_37 input_332; [L156] SORT_37 input_335; [L157] SORT_37 input_337; [L158] SORT_37 input_342; [L159] SORT_37 input_344; [L160] SORT_37 input_348; [L161] SORT_37 input_349; [L162] SORT_37 input_352; [L163] SORT_37 input_357; [L164] SORT_37 input_361; [L165] SORT_37 input_362; [L166] SORT_37 input_372; [L167] SORT_7 input_391; [L168] SORT_7 input_392; [L169] SORT_7 input_393; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L171] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L172] SORT_37 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L173] SORT_37 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L174] SORT_37 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L175] SORT_37 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L176] SORT_1 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L177] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L178] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L179] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L179] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L180] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L180] SORT_7 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L181] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L181] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L182] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L182] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L183] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L183] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L184] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L184] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L185] EXPR __VERIFIER_nondet_uchar() & mask_SORT_67 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L185] SORT_67 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_67; [L187] SORT_7 init_10_arg_1 = var_8; [L188] state_9 = init_10_arg_1 [L189] SORT_37 init_40_arg_1 = var_38; [L190] state_39 = init_40_arg_1 [L191] SORT_37 init_42_arg_1 = var_38; [L192] state_41 = init_42_arg_1 [L193] SORT_37 init_44_arg_1 = var_38; [L194] state_43 = init_44_arg_1 [L195] SORT_37 init_46_arg_1 = var_38; [L196] state_45 = init_46_arg_1 [L197] SORT_1 init_49_arg_1 = var_47; [L198] state_48 = init_49_arg_1 [L199] SORT_1 init_51_arg_1 = var_47; [L200] state_50 = init_51_arg_1 [L201] SORT_1 init_53_arg_1 = var_47; [L202] state_52 = init_53_arg_1 [L203] SORT_1 init_55_arg_1 = var_47; [L204] state_54 = init_55_arg_1 [L205] SORT_7 init_57_arg_1 = var_8; [L206] state_56 = init_57_arg_1 [L207] SORT_1 init_60_arg_1 = var_47; [L208] state_59 = init_60_arg_1 [L209] SORT_1 init_62_arg_1 = var_47; [L210] state_61 = init_62_arg_1 [L211] SORT_1 init_64_arg_1 = var_47; [L212] state_63 = init_64_arg_1 [L213] SORT_1 init_66_arg_1 = var_47; [L214] state_65 = init_66_arg_1 [L215] SORT_67 init_70_arg_1 = var_68; [L216] state_69 = init_70_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L219] input_2 = __VERIFIER_nondet_uchar() [L220] input_3 = __VERIFIER_nondet_uchar() [L221] input_4 = __VERIFIER_nondet_uchar() [L222] input_5 = __VERIFIER_nondet_uchar() [L223] input_6 = __VERIFIER_nondet_uchar() [L224] input_75 = __VERIFIER_nondet_uchar() [L225] input_76 = __VERIFIER_nondet_uchar() [L226] input_77 = __VERIFIER_nondet_uchar() [L227] input_78 = __VERIFIER_nondet_uchar() [L228] input_79 = __VERIFIER_nondet_uchar() [L229] input_80 = __VERIFIER_nondet_uchar() [L230] input_85 = __VERIFIER_nondet_uchar() [L231] input_87 = __VERIFIER_nondet_uchar() [L232] input_89 = __VERIFIER_nondet_uchar() [L233] input_94 = __VERIFIER_nondet_uchar() [L234] input_96 = __VERIFIER_nondet_uchar() [L235] input_98 = __VERIFIER_nondet_uchar() [L236] input_102 = __VERIFIER_nondet_uchar() [L237] input_103 = __VERIFIER_nondet_uchar() [L238] input_108 = __VERIFIER_nondet_uchar() [L239] input_110 = __VERIFIER_nondet_uchar() [L240] input_115 = __VERIFIER_nondet_uchar() [L241] input_117 = __VERIFIER_nondet_uchar() [L242] input_121 = __VERIFIER_nondet_uchar() [L243] input_122 = __VERIFIER_nondet_uchar() [L244] input_127 = __VERIFIER_nondet_uchar() [L245] input_132 = __VERIFIER_nondet_uchar() [L246] input_136 = __VERIFIER_nondet_uchar() [L247] input_137 = __VERIFIER_nondet_uchar() [L248] input_149 = __VERIFIER_nondet_uchar() [L249] input_160 = __VERIFIER_nondet_uchar() [L250] input_161 = __VERIFIER_nondet_uchar() [L251] input_162 = __VERIFIER_nondet_uchar() [L252] input_163 = __VERIFIER_nondet_uchar() [L253] input_164 = __VERIFIER_nondet_uchar() [L254] input_165 = __VERIFIER_nondet_uchar() [L255] input_168 = __VERIFIER_nondet_uchar() [L256] input_170 = __VERIFIER_nondet_uchar() [L257] input_172 = __VERIFIER_nondet_uchar() [L258] input_177 = __VERIFIER_nondet_uchar() [L259] input_179 = __VERIFIER_nondet_uchar() [L260] input_181 = __VERIFIER_nondet_uchar() [L261] input_185 = __VERIFIER_nondet_uchar() [L262] input_186 = __VERIFIER_nondet_uchar() [L263] input_189 = __VERIFIER_nondet_uchar() [L264] input_191 = __VERIFIER_nondet_uchar() [L265] input_196 = __VERIFIER_nondet_uchar() [L266] input_198 = __VERIFIER_nondet_uchar() [L267] input_202 = __VERIFIER_nondet_uchar() [L268] input_203 = __VERIFIER_nondet_uchar() [L269] input_206 = __VERIFIER_nondet_uchar() [L270] input_211 = __VERIFIER_nondet_uchar() [L271] input_215 = __VERIFIER_nondet_uchar() [L272] input_216 = __VERIFIER_nondet_uchar() [L273] input_226 = __VERIFIER_nondet_uchar() [L274] input_233 = __VERIFIER_nondet_uchar() [L275] input_234 = __VERIFIER_nondet_uchar() [L276] input_235 = __VERIFIER_nondet_uchar() [L277] input_236 = __VERIFIER_nondet_uchar() [L278] input_237 = __VERIFIER_nondet_uchar() [L279] input_238 = __VERIFIER_nondet_uchar() [L280] input_241 = __VERIFIER_nondet_uchar() [L281] input_243 = __VERIFIER_nondet_uchar() [L282] input_245 = __VERIFIER_nondet_uchar() [L283] input_250 = __VERIFIER_nondet_uchar() [L284] input_252 = __VERIFIER_nondet_uchar() [L285] input_254 = __VERIFIER_nondet_uchar() [L286] input_258 = __VERIFIER_nondet_uchar() [L287] input_259 = __VERIFIER_nondet_uchar() [L288] input_262 = __VERIFIER_nondet_uchar() [L289] input_264 = __VERIFIER_nondet_uchar() [L290] input_269 = __VERIFIER_nondet_uchar() [L291] input_271 = __VERIFIER_nondet_uchar() [L292] input_275 = __VERIFIER_nondet_uchar() [L293] input_276 = __VERIFIER_nondet_uchar() [L294] input_279 = __VERIFIER_nondet_uchar() [L295] input_284 = __VERIFIER_nondet_uchar() [L296] input_288 = __VERIFIER_nondet_uchar() [L297] input_289 = __VERIFIER_nondet_uchar() [L298] input_299 = __VERIFIER_nondet_uchar() [L299] input_306 = __VERIFIER_nondet_uchar() [L300] input_307 = __VERIFIER_nondet_uchar() [L301] input_308 = __VERIFIER_nondet_uchar() [L302] input_309 = __VERIFIER_nondet_uchar() [L303] input_310 = __VERIFIER_nondet_uchar() [L304] input_311 = __VERIFIER_nondet_uchar() [L305] input_314 = __VERIFIER_nondet_uchar() [L306] input_316 = __VERIFIER_nondet_uchar() [L307] input_318 = __VERIFIER_nondet_uchar() [L308] input_323 = __VERIFIER_nondet_uchar() [L309] input_325 = __VERIFIER_nondet_uchar() [L310] input_327 = __VERIFIER_nondet_uchar() [L311] input_331 = __VERIFIER_nondet_uchar() [L312] input_332 = __VERIFIER_nondet_uchar() [L313] input_335 = __VERIFIER_nondet_uchar() [L314] input_337 = __VERIFIER_nondet_uchar() [L315] input_342 = __VERIFIER_nondet_uchar() [L316] input_344 = __VERIFIER_nondet_uchar() [L317] input_348 = __VERIFIER_nondet_uchar() [L318] input_349 = __VERIFIER_nondet_uchar() [L319] input_352 = __VERIFIER_nondet_uchar() [L320] input_357 = __VERIFIER_nondet_uchar() [L321] input_361 = __VERIFIER_nondet_uchar() [L322] input_362 = __VERIFIER_nondet_uchar() [L323] input_372 = __VERIFIER_nondet_uchar() [L324] input_391 = __VERIFIER_nondet_uchar() [L325] input_392 = __VERIFIER_nondet_uchar() [L326] input_393 = __VERIFIER_nondet_uchar() [L329] SORT_7 var_12_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_12_arg_0=0, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L330] EXPR var_12_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L330] var_12_arg_0 = var_12_arg_0 & mask_SORT_7 [L331] SORT_11 var_12 = var_12_arg_0; [L332] SORT_11 var_14_arg_0 = var_12; [L333] SORT_11 var_14_arg_1 = var_13; [L334] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L335] SORT_7 var_15_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_14=1, var_154=2, var_15_arg_0=0, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L336] EXPR var_15_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_14=1, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L336] var_15_arg_0 = var_15_arg_0 & mask_SORT_7 [L337] SORT_11 var_15 = var_15_arg_0; [L338] SORT_11 var_17_arg_0 = var_15; [L339] SORT_11 var_17_arg_1 = var_16; [L340] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L341] SORT_1 var_18_arg_0 = var_14; [L342] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_18_arg_0=1, var_18_arg_1=0, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L343] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L343] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L344] SORT_7 var_19_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_18=1, var_19_arg_0=0, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L345] EXPR var_19_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_18=1, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L345] var_19_arg_0 = var_19_arg_0 & mask_SORT_7 [L346] SORT_11 var_19 = var_19_arg_0; [L347] SORT_11 var_21_arg_0 = var_19; [L348] SORT_11 var_21_arg_1 = var_20; [L349] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L350] SORT_1 var_22_arg_0 = var_18; [L351] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_22_arg_0=1, var_22_arg_1=0, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L352] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L352] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L353] SORT_7 var_23_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_22=1, var_23_arg_0=0, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L354] EXPR var_23_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_22=1, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L354] var_23_arg_0 = var_23_arg_0 & mask_SORT_7 [L355] SORT_11 var_23 = var_23_arg_0; [L356] SORT_11 var_25_arg_0 = var_23; [L357] SORT_11 var_25_arg_1 = var_24; [L358] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L359] SORT_1 var_26_arg_0 = var_22; [L360] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_26_arg_0=1, var_26_arg_1=0, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L361] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L361] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L362] SORT_7 var_27_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_26=1, var_27_arg_0=0, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L363] EXPR var_27_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_26=1, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L363] var_27_arg_0 = var_27_arg_0 & mask_SORT_7 [L364] SORT_11 var_27 = var_27_arg_0; [L365] SORT_11 var_29_arg_0 = var_27; [L366] SORT_11 var_29_arg_1 = var_28; [L367] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L368] SORT_1 var_30_arg_0 = var_26; [L369] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_30_arg_0=1, var_30_arg_1=0, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L370] EXPR var_30_arg_0 | var_30_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L370] SORT_1 var_30 = var_30_arg_0 | var_30_arg_1; [L371] SORT_1 var_34_arg_0 = var_30; [L372] SORT_1 var_34 = ~var_34_arg_0; [L373] SORT_1 var_35_arg_0 = var_33; [L374] SORT_1 var_35_arg_1 = var_34; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_35_arg_0=1, var_35_arg_1=-2, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L375] EXPR var_35_arg_0 & var_35_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L375] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L376] EXPR var_35 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L376] var_35 = var_35 & mask_SORT_1 [L377] SORT_1 bad_36_arg_0 = var_35; [L378] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 186 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3469 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3469 mSDsluCounter, 20400 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16726 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1291 IncrementalHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 3674 mSDtfsCounter, 1291 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=365occurred in iteration=13, InterpolantAutomatonStates: 105, 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, 14 MinimizatonAttempts, 161 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 913 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 835 ConstructedInterpolants, 0 QuantifiedInterpolants, 2682 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 00:06:32,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:06:35,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:06:35,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-12 00:06:35,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:06:35,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:06:35,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:06:35,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:06:35,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:06:35,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:06:35,440 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:06:35,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:06:35,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:06:35,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:06:35,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:06:35,444 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:06:35,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:06:35,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:06:35,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:06:35,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:06:35,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:06:35,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:06:35,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 00:06:35,448 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 00:06:35,448 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:06:35,448 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 00:06:35,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:06:35,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:06:35,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:06:35,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:06:35,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:06:35,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:06:35,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:06:35,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:06:35,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:06:35,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:06:35,452 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 00:06:35,452 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 00:06:35,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:06:35,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:06:35,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:06:35,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:06:35,454 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 [2024-11-12 00:06:35,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:06:35,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:06:35,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:06:35,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:06:35,916 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:06:35,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-11-12 00:06:37,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:06:38,004 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:06:38,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-11-12 00:06:38,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/776b7f9b8/214730a53b52495a9024c4a70dc9975b/FLAGd25448702 [2024-11-12 00:06:38,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/776b7f9b8/214730a53b52495a9024c4a70dc9975b [2024-11-12 00:06:38,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:06:38,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:06:38,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:06:38,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:06:38,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:06:38,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:38,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb9fb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38, skipping insertion in model container [2024-11-12 00:06:38,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:38,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:06:38,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c[1245,1258] [2024-11-12 00:06:38,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:06:38,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:06:38,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c[1245,1258] [2024-11-12 00:06:38,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:06:38,859 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:06:38,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38 WrapperNode [2024-11-12 00:06:38,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:06:38,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:06:38,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:06:38,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:06:38,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:38,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:39,053 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1557 [2024-11-12 00:06:39,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:06:39,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:06:39,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:06:39,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:06:39,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:39,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:39,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:39,137 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]. [2024-11-12 00:06:39,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:39,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:39,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:39,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:39,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:39,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:39,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:06:39,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:06:39,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:06:39,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:06:39,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (1/1) ... [2024-11-12 00:06:39,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:06:39,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:06:39,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:06:39,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:06:39,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:06:39,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 00:06:39,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 00:06:39,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:06:39,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:06:39,691 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:06:39,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:06:40,792 INFO L? ?]: Removed 177 outVars from TransFormulas that were not future-live. [2024-11-12 00:06:40,792 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:06:40,804 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:06:40,804 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:06:40,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:06:40 BoogieIcfgContainer [2024-11-12 00:06:40,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:06:40,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:06:40,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:06:40,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:06:40,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:06:38" (1/3) ... [2024-11-12 00:06:40,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ad72c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:06:40, skipping insertion in model container [2024-11-12 00:06:40,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:06:38" (2/3) ... [2024-11-12 00:06:40,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ad72c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:06:40, skipping insertion in model container [2024-11-12 00:06:40,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:06:40" (3/3) ... [2024-11-12 00:06:40,818 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b03.c [2024-11-12 00:06:40,837 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:06:40,837 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:06:40,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:06:40,914 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;@4b7dc9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:06:40,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:06:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 00:06:40,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:40,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 00:06:40,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:40,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:40,937 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-12 00:06:40,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:06:40,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282525483] [2024-11-12 00:06:40,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:40,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:06:40,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:06:40,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 00:06:40,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 00:06:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:41,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 00:06:41,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:06:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:41,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:06:41,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:06:41,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282525483] [2024-11-12 00:06:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282525483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:06:41,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:06:41,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:06:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005143451] [2024-11-12 00:06:41,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:06:41,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:06:41,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:06:41,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:06:41,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:06:41,660 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:41,761 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-12 00:06:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:06:41,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 00:06:41,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:41,773 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:06:41,773 INFO L226 Difference]: Without dead ends: 10 [2024-11-12 00:06:41,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:06:41,780 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:41,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:06:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-12 00:06:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-12 00:06:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-12 00:06:41,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-12 00:06:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:41,847 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-12 00:06:41,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-12 00:06:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 00:06:41,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:41,848 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-12 00:06:41,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 00:06:42,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:06:42,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:42,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-12 00:06:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:06:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074042059] [2024-11-12 00:06:42,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:06:42,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:06:42,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:06:42,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 00:06:42,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 00:06:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:06:42,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 00:06:42,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:06:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:42,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:06:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:43,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:06:43,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074042059] [2024-11-12 00:06:43,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074042059] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:06:43,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:06:43,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 00:06:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488610108] [2024-11-12 00:06:43,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:06:43,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:06:43,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:06:43,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:06:43,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:06:43,599 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:06:43,752 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-12 00:06:43,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:06:43,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 00:06:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:06:43,754 INFO L225 Difference]: With dead ends: 15 [2024-11-12 00:06:43,754 INFO L226 Difference]: Without dead ends: 13 [2024-11-12 00:06:43,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:06:43,756 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:06:43,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:06:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-12 00:06:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-12 00:06:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-12 00:06:43,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-12 00:06:43,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:06:43,764 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-12 00:06:43,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:06:43,765 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-12 00:06:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 00:06:43,766 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:06:43,766 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-12 00:06:43,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 00:06:43,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:06:43,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:06:43,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:06:43,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-12 00:06:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:06:43,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772848169] [2024-11-12 00:06:43,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 00:06:43,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:06:43,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:06:43,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 00:06:43,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 00:06:44,684 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 00:06:44,684 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:06:44,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-12 00:06:44,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:06:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:06:54,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:07:16,357 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 454 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)