./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.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 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:40:19,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:40:19,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 23:40:19,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:40:19,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:40:19,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:40:19,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:40:19,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:40:19,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:40:19,451 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:40:19,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:40:19,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:40:19,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:40:19,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:40:19,453 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:40:19,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:40:19,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:40:19,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:40:19,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:40:19,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:40:19,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:40:19,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:40:19,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:40:19,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:40:19,458 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:40:19,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:40:19,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:40:19,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:40:19,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:40:19,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:40:19,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:40:19,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:40:19,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:40:19,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:40:19,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:40:19,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:40:19,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:40:19,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:40:19,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:40:19,461 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 -> 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f [2024-10-12 23:40:19,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:40:19,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:40:19,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:40:19,701 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:40:19,701 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:40:19,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-10-12 23:40:20,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:40:21,185 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:40:21,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-10-12 23:40:21,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6774354f/1050481eeec64522850548b94bbea291/FLAG618555699 [2024-10-12 23:40:21,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6774354f/1050481eeec64522850548b94bbea291 [2024-10-12 23:40:21,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:40:21,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:40:21,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:40:21,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:40:21,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:40:21,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:40:21" (1/1) ... [2024-10-12 23:40:21,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d0a314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:21, skipping insertion in model container [2024-10-12 23:40:21,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:40:21" (1/1) ... [2024-10-12 23:40:21,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:40:21,772 WARN L248 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281] [2024-10-12 23:40:22,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:40:22,062 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:40:22,072 WARN L248 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281] [2024-10-12 23:40:22,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:40:22,191 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:40:22,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22 WrapperNode [2024-10-12 23:40:22,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:40:22,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:40:22,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:40:22,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:40:22,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (1/1) ... [2024-10-12 23:40:22,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (1/1) ... [2024-10-12 23:40:22,647 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4881 [2024-10-12 23:40:22,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:40:22,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:40:22,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:40:22,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:40:22,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (1/1) ... [2024-10-12 23:40:22,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (1/1) ... [2024-10-12 23:40:22,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (1/1) ... [2024-10-12 23:40:22,946 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:40:22,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (1/1) ... [2024-10-12 23:40:22,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (1/1) ... [2024-10-12 23:40:23,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (1/1) ... [2024-10-12 23:40:23,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (1/1) ... [2024-10-12 23:40:23,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (1/1) ... [2024-10-12 23:40:23,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (1/1) ... [2024-10-12 23:40:23,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:40:23,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:40:23,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:40:23,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:40:23,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (1/1) ... [2024-10-12 23:40:23,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:40:23,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:40:23,291 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-10-12 23:40:23,296 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-10-12 23:40:23,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:40:23,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:40:23,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:40:23,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:40:23,883 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:40:23,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:40:27,174 INFO L? ?]: Removed 3163 outVars from TransFormulas that were not future-live. [2024-10-12 23:40:27,174 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:40:27,249 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:40:27,250 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:40:27,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:40:27 BoogieIcfgContainer [2024-10-12 23:40:27,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:40:27,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:40:27,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:40:27,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:40:27,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:40:21" (1/3) ... [2024-10-12 23:40:27,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ab05ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:40:27, skipping insertion in model container [2024-10-12 23:40:27,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:22" (2/3) ... [2024-10-12 23:40:27,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ab05ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:40:27, skipping insertion in model container [2024-10-12 23:40:27,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:40:27" (3/3) ... [2024-10-12 23:40:27,257 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-10-12 23:40:27,272 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:40:27,273 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:40:27,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:40:27,346 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;@381861ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:40:27,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:40:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 1127 states, 1125 states have (on average 1.5004444444444445) internal successors, (1688), 1126 states have internal predecessors, (1688), 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-10-12 23:40:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 23:40:27,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:27,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:27,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:27,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:27,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1261099556, now seen corresponding path program 1 times [2024-10-12 23:40:27,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:27,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971203406] [2024-10-12 23:40:27,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:27,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:27,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:27,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971203406] [2024-10-12 23:40:27,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971203406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:27,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:27,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:40:27,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130578839] [2024-10-12 23:40:27,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:27,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:40:27,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:28,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:40:28,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:40:28,011 INFO L87 Difference]: Start difference. First operand has 1127 states, 1125 states have (on average 1.5004444444444445) internal successors, (1688), 1126 states have internal predecessors, (1688), 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 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-10-12 23:40:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:28,110 INFO L93 Difference]: Finished difference Result 2138 states and 3204 transitions. [2024-10-12 23:40:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:40:28,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 90 [2024-10-12 23:40:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:28,125 INFO L225 Difference]: With dead ends: 2138 [2024-10-12 23:40:28,125 INFO L226 Difference]: Without dead ends: 1128 [2024-10-12 23:40:28,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:40:28,133 INFO L432 NwaCegarLoop]: 1683 mSDtfsCounter, 0 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5044 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:28,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5044 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:40:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2024-10-12 23:40:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2024-10-12 23:40:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 1.497781721384206) internal successors, (1688), 1127 states have internal predecessors, (1688), 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-10-12 23:40:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1688 transitions. [2024-10-12 23:40:28,191 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1688 transitions. Word has length 90 [2024-10-12 23:40:28,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:28,192 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1688 transitions. [2024-10-12 23:40:28,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-10-12 23:40:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1688 transitions. [2024-10-12 23:40:28,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 23:40:28,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:28,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:28,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:40:28,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:28,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash -437684860, now seen corresponding path program 1 times [2024-10-12 23:40:28,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:28,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52558596] [2024-10-12 23:40:28,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:28,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:28,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52558596] [2024-10-12 23:40:28,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52558596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:28,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:28,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:40:28,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780617377] [2024-10-12 23:40:28,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:28,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:40:28,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:28,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:40:28,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:40:28,409 INFO L87 Difference]: Start difference. First operand 1128 states and 1688 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-10-12 23:40:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:28,454 INFO L93 Difference]: Finished difference Result 2141 states and 3204 transitions. [2024-10-12 23:40:28,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:40:28,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2024-10-12 23:40:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:28,457 INFO L225 Difference]: With dead ends: 2141 [2024-10-12 23:40:28,457 INFO L226 Difference]: Without dead ends: 1130 [2024-10-12 23:40:28,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:40:28,459 INFO L432 NwaCegarLoop]: 1683 mSDtfsCounter, 0 mSDsluCounter, 3358 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5041 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:28,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5041 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:40:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-10-12 23:40:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2024-10-12 23:40:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 1.4968999114260408) internal successors, (1690), 1129 states have internal predecessors, (1690), 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-10-12 23:40:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1690 transitions. [2024-10-12 23:40:28,474 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1690 transitions. Word has length 91 [2024-10-12 23:40:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:28,475 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1690 transitions. [2024-10-12 23:40:28,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-10-12 23:40:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1690 transitions. [2024-10-12 23:40:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 23:40:28,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:28,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:28,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:40:28,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:28,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:28,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1781294155, now seen corresponding path program 1 times [2024-10-12 23:40:28,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:28,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517686656] [2024-10-12 23:40:28,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:28,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:28,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517686656] [2024-10-12 23:40:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517686656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:28,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:28,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:40:28,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753970168] [2024-10-12 23:40:28,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:28,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:40:28,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:28,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:40:28,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:40:28,869 INFO L87 Difference]: Start difference. First operand 1130 states and 1690 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 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-10-12 23:40:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:29,001 INFO L93 Difference]: Finished difference Result 2147 states and 3211 transitions. [2024-10-12 23:40:29,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:40:29,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 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 92 [2024-10-12 23:40:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:29,004 INFO L225 Difference]: With dead ends: 2147 [2024-10-12 23:40:29,005 INFO L226 Difference]: Without dead ends: 1134 [2024-10-12 23:40:29,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:40:29,006 INFO L432 NwaCegarLoop]: 1675 mSDtfsCounter, 1608 mSDsluCounter, 5020 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 6695 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:29,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 6695 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:40:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2024-10-12 23:40:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1133. [2024-10-12 23:40:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.495583038869258) internal successors, (1693), 1132 states have internal predecessors, (1693), 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-10-12 23:40:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1693 transitions. [2024-10-12 23:40:29,020 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1693 transitions. Word has length 92 [2024-10-12 23:40:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:29,020 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1693 transitions. [2024-10-12 23:40:29,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 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-10-12 23:40:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1693 transitions. [2024-10-12 23:40:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 23:40:29,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:29,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:29,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:40:29,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:29,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:29,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2115965593, now seen corresponding path program 1 times [2024-10-12 23:40:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:29,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892989152] [2024-10-12 23:40:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:29,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:29,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:29,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892989152] [2024-10-12 23:40:29,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892989152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:29,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:29,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:40:29,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775874049] [2024-10-12 23:40:29,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:29,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:40:29,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:29,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:40:29,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:40:29,658 INFO L87 Difference]: Start difference. First operand 1133 states and 1693 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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-10-12 23:40:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:29,805 INFO L93 Difference]: Finished difference Result 2193 states and 3277 transitions. [2024-10-12 23:40:29,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:40:29,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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 93 [2024-10-12 23:40:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:29,808 INFO L225 Difference]: With dead ends: 2193 [2024-10-12 23:40:29,808 INFO L226 Difference]: Without dead ends: 1177 [2024-10-12 23:40:29,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:40:29,810 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 1751 mSDsluCounter, 3331 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 4998 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:29,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 4998 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:40:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2024-10-12 23:40:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1140. [2024-10-12 23:40:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.4942932396839332) internal successors, (1702), 1139 states have internal predecessors, (1702), 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-10-12 23:40:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1702 transitions. [2024-10-12 23:40:29,822 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1702 transitions. Word has length 93 [2024-10-12 23:40:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:29,822 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1702 transitions. [2024-10-12 23:40:29,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 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-10-12 23:40:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1702 transitions. [2024-10-12 23:40:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 23:40:29,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:29,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:29,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:40:29,824 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:29,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash -649103509, now seen corresponding path program 1 times [2024-10-12 23:40:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:29,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275414551] [2024-10-12 23:40:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:29,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:30,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:30,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275414551] [2024-10-12 23:40:30,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275414551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:30,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:30,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 23:40:30,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561034472] [2024-10-12 23:40:30,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:30,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:40:30,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:30,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:40:30,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:40:30,495 INFO L87 Difference]: Start difference. First operand 1140 states and 1702 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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-10-12 23:40:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:30,634 INFO L93 Difference]: Finished difference Result 2176 states and 3250 transitions. [2024-10-12 23:40:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 23:40:30,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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 94 [2024-10-12 23:40:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:30,641 INFO L225 Difference]: With dead ends: 2176 [2024-10-12 23:40:30,642 INFO L226 Difference]: Without dead ends: 1160 [2024-10-12 23:40:30,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:40:30,645 INFO L432 NwaCegarLoop]: 1677 mSDtfsCounter, 18 mSDsluCounter, 8394 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10071 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:30,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 10071 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:40:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-10-12 23:40:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1157. [2024-10-12 23:40:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4930795847750864) internal successors, (1726), 1156 states have internal predecessors, (1726), 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-10-12 23:40:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1726 transitions. [2024-10-12 23:40:30,660 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1726 transitions. Word has length 94 [2024-10-12 23:40:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:30,661 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1726 transitions. [2024-10-12 23:40:30,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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-10-12 23:40:30,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1726 transitions. [2024-10-12 23:40:30,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 23:40:30,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:30,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:30,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 23:40:30,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:30,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1604147754, now seen corresponding path program 1 times [2024-10-12 23:40:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:30,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809584020] [2024-10-12 23:40:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:31,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:31,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809584020] [2024-10-12 23:40:31,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809584020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:31,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:31,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 23:40:31,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570195921] [2024-10-12 23:40:31,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:31,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 23:40:31,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:31,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 23:40:31,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-12 23:40:31,587 INFO L87 Difference]: Start difference. First operand 1157 states and 1726 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:31,941 INFO L93 Difference]: Finished difference Result 2237 states and 3337 transitions. [2024-10-12 23:40:31,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 23:40:31,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-10-12 23:40:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:31,945 INFO L225 Difference]: With dead ends: 2237 [2024-10-12 23:40:31,945 INFO L226 Difference]: Without dead ends: 1204 [2024-10-12 23:40:31,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-10-12 23:40:31,947 INFO L432 NwaCegarLoop]: 1655 mSDtfsCounter, 1756 mSDsluCounter, 8455 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 10110 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:31,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 10110 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:40:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2024-10-12 23:40:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1185. [2024-10-12 23:40:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.491554054054054) internal successors, (1766), 1184 states have internal predecessors, (1766), 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-10-12 23:40:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1766 transitions. [2024-10-12 23:40:31,966 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1766 transitions. Word has length 95 [2024-10-12 23:40:31,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:31,967 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1766 transitions. [2024-10-12 23:40:31,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1766 transitions. [2024-10-12 23:40:31,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 23:40:31,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:31,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:31,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 23:40:31,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:31,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:31,972 INFO L85 PathProgramCache]: Analyzing trace with hash -21677351, now seen corresponding path program 1 times [2024-10-12 23:40:31,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:31,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480709446] [2024-10-12 23:40:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:31,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:32,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:32,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480709446] [2024-10-12 23:40:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480709446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:32,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:32,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 23:40:32,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619328083] [2024-10-12 23:40:32,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:32,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 23:40:32,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:32,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 23:40:32,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:40:32,590 INFO L87 Difference]: Start difference. First operand 1185 states and 1766 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:32,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:32,871 INFO L93 Difference]: Finished difference Result 2240 states and 3338 transitions. [2024-10-12 23:40:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 23:40:32,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-12 23:40:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:32,875 INFO L225 Difference]: With dead ends: 2240 [2024-10-12 23:40:32,875 INFO L226 Difference]: Without dead ends: 1204 [2024-10-12 23:40:32,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-10-12 23:40:32,877 INFO L432 NwaCegarLoop]: 1657 mSDtfsCounter, 1767 mSDsluCounter, 6746 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 8403 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:32,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 8403 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:40:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2024-10-12 23:40:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1185. [2024-10-12 23:40:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.4907094594594594) internal successors, (1765), 1184 states have internal predecessors, (1765), 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-10-12 23:40:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1765 transitions. [2024-10-12 23:40:32,894 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1765 transitions. Word has length 96 [2024-10-12 23:40:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:32,895 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1765 transitions. [2024-10-12 23:40:32,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1765 transitions. [2024-10-12 23:40:32,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 23:40:32,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:32,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:32,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 23:40:32,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:32,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:32,898 INFO L85 PathProgramCache]: Analyzing trace with hash -93005871, now seen corresponding path program 1 times [2024-10-12 23:40:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614745634] [2024-10-12 23:40:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:33,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:33,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614745634] [2024-10-12 23:40:33,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614745634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:33,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:33,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:40:33,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384431240] [2024-10-12 23:40:33,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:33,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:40:33,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:33,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:40:33,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:40:33,363 INFO L87 Difference]: Start difference. First operand 1185 states and 1765 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:33,541 INFO L93 Difference]: Finished difference Result 2240 states and 3339 transitions. [2024-10-12 23:40:33,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:40:33,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 23:40:33,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:33,545 INFO L225 Difference]: With dead ends: 2240 [2024-10-12 23:40:33,545 INFO L226 Difference]: Without dead ends: 1207 [2024-10-12 23:40:33,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:40:33,547 INFO L432 NwaCegarLoop]: 1662 mSDtfsCounter, 1746 mSDsluCounter, 3425 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 5087 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:33,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 5087 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:40:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2024-10-12 23:40:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1195. [2024-10-12 23:40:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1194 states have (on average 1.4899497487437185) internal successors, (1779), 1194 states have internal predecessors, (1779), 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-10-12 23:40:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1779 transitions. [2024-10-12 23:40:33,562 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1779 transitions. Word has length 97 [2024-10-12 23:40:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:33,562 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1779 transitions. [2024-10-12 23:40:33,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1779 transitions. [2024-10-12 23:40:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 23:40:33,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:33,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:33,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 23:40:33,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:33,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:33,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1002897299, now seen corresponding path program 1 times [2024-10-12 23:40:33,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:33,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896745510] [2024-10-12 23:40:33,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:33,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:34,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:34,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896745510] [2024-10-12 23:40:34,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896745510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:34,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:34,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:40:34,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081985702] [2024-10-12 23:40:34,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:34,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:40:34,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:34,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:40:34,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:40:34,024 INFO L87 Difference]: Start difference. First operand 1195 states and 1779 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:34,167 INFO L93 Difference]: Finished difference Result 2243 states and 3342 transitions. [2024-10-12 23:40:34,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:40:34,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 23:40:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:34,171 INFO L225 Difference]: With dead ends: 2243 [2024-10-12 23:40:34,171 INFO L226 Difference]: Without dead ends: 1204 [2024-10-12 23:40:34,174 INFO L431 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-10-12 23:40:34,175 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 1735 mSDsluCounter, 3329 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 4994 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:34,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1735 Valid, 4994 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:40:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2024-10-12 23:40:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1194. [2024-10-12 23:40:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1193 states have (on average 1.4886839899413244) internal successors, (1776), 1193 states have internal predecessors, (1776), 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-10-12 23:40:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1776 transitions. [2024-10-12 23:40:34,192 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1776 transitions. Word has length 97 [2024-10-12 23:40:34,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:34,192 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1776 transitions. [2024-10-12 23:40:34,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1776 transitions. [2024-10-12 23:40:34,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 23:40:34,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:34,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:34,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 23:40:34,193 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:34,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:34,194 INFO L85 PathProgramCache]: Analyzing trace with hash 49822566, now seen corresponding path program 1 times [2024-10-12 23:40:34,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:34,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423153099] [2024-10-12 23:40:34,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:34,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:34,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423153099] [2024-10-12 23:40:34,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423153099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:34,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:34,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:40:34,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624604038] [2024-10-12 23:40:34,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:34,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:40:34,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:34,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:40:34,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:40:34,574 INFO L87 Difference]: Start difference. First operand 1194 states and 1776 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:34,904 INFO L93 Difference]: Finished difference Result 2242 states and 3336 transitions. [2024-10-12 23:40:34,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:40:34,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 23:40:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:34,910 INFO L225 Difference]: With dead ends: 2242 [2024-10-12 23:40:34,911 INFO L226 Difference]: Without dead ends: 1189 [2024-10-12 23:40:34,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:40:34,912 INFO L432 NwaCegarLoop]: 1666 mSDtfsCounter, 1734 mSDsluCounter, 6654 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 8320 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:34,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1734 Valid, 8320 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:40:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2024-10-12 23:40:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1182. [2024-10-12 23:40:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.487722269263336) internal successors, (1757), 1181 states have internal predecessors, (1757), 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-10-12 23:40:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1757 transitions. [2024-10-12 23:40:34,931 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1757 transitions. Word has length 97 [2024-10-12 23:40:34,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:34,932 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1757 transitions. [2024-10-12 23:40:34,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1757 transitions. [2024-10-12 23:40:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 23:40:34,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:34,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:34,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 23:40:34,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:34,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:34,935 INFO L85 PathProgramCache]: Analyzing trace with hash -232952711, now seen corresponding path program 1 times [2024-10-12 23:40:34,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:34,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692303019] [2024-10-12 23:40:34,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:34,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:35,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:35,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692303019] [2024-10-12 23:40:35,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692303019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:35,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:35,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 23:40:35,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623330890] [2024-10-12 23:40:35,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:35,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 23:40:35,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:35,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 23:40:35,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-12 23:40:35,744 INFO L87 Difference]: Start difference. First operand 1182 states and 1757 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:36,068 INFO L93 Difference]: Finished difference Result 2229 states and 3320 transitions. [2024-10-12 23:40:36,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 23:40:36,069 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-12 23:40:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:36,072 INFO L225 Difference]: With dead ends: 2229 [2024-10-12 23:40:36,072 INFO L226 Difference]: Without dead ends: 1196 [2024-10-12 23:40:36,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2024-10-12 23:40:36,073 INFO L432 NwaCegarLoop]: 1656 mSDtfsCounter, 1718 mSDsluCounter, 8436 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 10092 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:36,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 10092 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:40:36,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2024-10-12 23:40:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1189. [2024-10-12 23:40:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1188 states have (on average 1.4873737373737375) internal successors, (1767), 1188 states have internal predecessors, (1767), 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-10-12 23:40:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1767 transitions. [2024-10-12 23:40:36,090 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1767 transitions. Word has length 98 [2024-10-12 23:40:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:36,090 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1767 transitions. [2024-10-12 23:40:36,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1767 transitions. [2024-10-12 23:40:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 23:40:36,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:36,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:36,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 23:40:36,091 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:36,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash -888611011, now seen corresponding path program 1 times [2024-10-12 23:40:36,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:36,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068023572] [2024-10-12 23:40:36,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:36,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:36,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:36,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068023572] [2024-10-12 23:40:36,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068023572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:36,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:36,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:40:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168878852] [2024-10-12 23:40:36,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:36,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:40:36,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:36,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:40:36,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:40:36,580 INFO L87 Difference]: Start difference. First operand 1189 states and 1767 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:36,734 INFO L93 Difference]: Finished difference Result 2232 states and 3321 transitions. [2024-10-12 23:40:36,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:40:36,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-12 23:40:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:36,737 INFO L225 Difference]: With dead ends: 2232 [2024-10-12 23:40:36,737 INFO L226 Difference]: Without dead ends: 1196 [2024-10-12 23:40:36,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:40:36,739 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 1714 mSDsluCounter, 5020 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 6681 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:36,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 6681 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:40:36,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2024-10-12 23:40:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1189. [2024-10-12 23:40:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1188 states have (on average 1.4865319865319866) internal successors, (1766), 1188 states have internal predecessors, (1766), 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-10-12 23:40:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1766 transitions. [2024-10-12 23:40:36,752 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1766 transitions. Word has length 98 [2024-10-12 23:40:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:36,752 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1766 transitions. [2024-10-12 23:40:36,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1766 transitions. [2024-10-12 23:40:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 23:40:36,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:36,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:36,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 23:40:36,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:36,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:36,754 INFO L85 PathProgramCache]: Analyzing trace with hash -662943812, now seen corresponding path program 1 times [2024-10-12 23:40:36,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:36,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785356367] [2024-10-12 23:40:36,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:36,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:37,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:37,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785356367] [2024-10-12 23:40:37,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785356367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:37,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:37,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-12 23:40:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929668080] [2024-10-12 23:40:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:37,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 23:40:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 23:40:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-12 23:40:37,678 INFO L87 Difference]: Start difference. First operand 1189 states and 1766 transitions. Second operand has 19 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:38,240 INFO L93 Difference]: Finished difference Result 2252 states and 3353 transitions. [2024-10-12 23:40:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 23:40:38,240 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-12 23:40:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:38,244 INFO L225 Difference]: With dead ends: 2252 [2024-10-12 23:40:38,244 INFO L226 Difference]: Without dead ends: 1219 [2024-10-12 23:40:38,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-10-12 23:40:38,246 INFO L432 NwaCegarLoop]: 1666 mSDtfsCounter, 1647 mSDsluCounter, 26612 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 28278 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:38,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1647 Valid, 28278 Invalid, 744 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:40:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-10-12 23:40:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1209. [2024-10-12 23:40:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 1.4892384105960266) internal successors, (1799), 1208 states have internal predecessors, (1799), 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-10-12 23:40:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1799 transitions. [2024-10-12 23:40:38,264 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1799 transitions. Word has length 99 [2024-10-12 23:40:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:38,265 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1799 transitions. [2024-10-12 23:40:38,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1799 transitions. [2024-10-12 23:40:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 23:40:38,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:38,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:38,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 23:40:38,266 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:38,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:38,267 INFO L85 PathProgramCache]: Analyzing trace with hash -48649324, now seen corresponding path program 1 times [2024-10-12 23:40:38,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:38,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091093904] [2024-10-12 23:40:38,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:38,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:38,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091093904] [2024-10-12 23:40:38,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091093904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:38,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:38,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:40:38,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499437229] [2024-10-12 23:40:38,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:38,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:40:38,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:38,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:40:38,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:40:38,595 INFO L87 Difference]: Start difference. First operand 1209 states and 1799 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:38,695 INFO L93 Difference]: Finished difference Result 2264 states and 3376 transitions. [2024-10-12 23:40:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:40:38,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-12 23:40:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:38,699 INFO L225 Difference]: With dead ends: 2264 [2024-10-12 23:40:38,699 INFO L226 Difference]: Without dead ends: 1211 [2024-10-12 23:40:38,700 INFO L431 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-10-12 23:40:38,701 INFO L432 NwaCegarLoop]: 1666 mSDtfsCounter, 1699 mSDsluCounter, 3329 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 4995 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:38,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 4995 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:40:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2024-10-12 23:40:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1209. [2024-10-12 23:40:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 1.4884105960264902) internal successors, (1798), 1208 states have internal predecessors, (1798), 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-10-12 23:40:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1798 transitions. [2024-10-12 23:40:38,718 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1798 transitions. Word has length 99 [2024-10-12 23:40:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:38,718 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1798 transitions. [2024-10-12 23:40:38,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1798 transitions. [2024-10-12 23:40:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 23:40:38,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:38,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:38,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 23:40:38,720 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:38,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1806843328, now seen corresponding path program 1 times [2024-10-12 23:40:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:38,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610439930] [2024-10-12 23:40:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:39,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:39,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610439930] [2024-10-12 23:40:39,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610439930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:39,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:39,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:40:39,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17227023] [2024-10-12 23:40:39,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:39,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:40:39,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:39,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:40:39,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:40:39,355 INFO L87 Difference]: Start difference. First operand 1209 states and 1798 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:39,621 INFO L93 Difference]: Finished difference Result 3158 states and 4702 transitions. [2024-10-12 23:40:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:40:39,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-12 23:40:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:39,629 INFO L225 Difference]: With dead ends: 3158 [2024-10-12 23:40:39,629 INFO L226 Difference]: Without dead ends: 2077 [2024-10-12 23:40:39,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:40:39,631 INFO L432 NwaCegarLoop]: 1657 mSDtfsCounter, 2956 mSDsluCounter, 6625 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2956 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:39,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2956 Valid, 8282 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:40:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2024-10-12 23:40:39,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 1212. [2024-10-12 23:40:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 1.486374896779521) internal successors, (1800), 1211 states have internal predecessors, (1800), 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-10-12 23:40:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1800 transitions. [2024-10-12 23:40:39,656 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1800 transitions. Word has length 100 [2024-10-12 23:40:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:39,656 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1800 transitions. [2024-10-12 23:40:39,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1800 transitions. [2024-10-12 23:40:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 23:40:39,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:39,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:39,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 23:40:39,657 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:39,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:39,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1317092170, now seen corresponding path program 1 times [2024-10-12 23:40:39,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:39,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808222088] [2024-10-12 23:40:39,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:39,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:40,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:40:40,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808222088] [2024-10-12 23:40:40,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808222088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:40,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:40,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:40:40,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822542251] [2024-10-12 23:40:40,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:40,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:40:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:40:40,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:40:40,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:40:40,064 INFO L87 Difference]: Start difference. First operand 1212 states and 1800 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 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-10-12 23:40:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:40,375 INFO L93 Difference]: Finished difference Result 3154 states and 4693 transitions. [2024-10-12 23:40:40,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:40:40,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 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 101 [2024-10-12 23:40:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:40,381 INFO L225 Difference]: With dead ends: 3154 [2024-10-12 23:40:40,381 INFO L226 Difference]: Without dead ends: 2081 [2024-10-12 23:40:40,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:40:40,383 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 4285 mSDsluCounter, 6275 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4285 SdHoareTripleChecker+Valid, 7933 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:40,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4285 Valid, 7933 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:40:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2024-10-12 23:40:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 1214. [2024-10-12 23:40:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 1.4855729596042868) internal successors, (1802), 1213 states have internal predecessors, (1802), 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-10-12 23:40:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1802 transitions. [2024-10-12 23:40:40,400 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1802 transitions. Word has length 101 [2024-10-12 23:40:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:40,401 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1802 transitions. [2024-10-12 23:40:40,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 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-10-12 23:40:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1802 transitions. [2024-10-12 23:40:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 23:40:40,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:40,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 23:40:40,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 23:40:40,402 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:40,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:40,403 INFO L85 PathProgramCache]: Analyzing trace with hash -416206873, now seen corresponding path program 1 times [2024-10-12 23:40:40,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:40:40,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159679167] [2024-10-12 23:40:40,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:40,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:40:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:40:40,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:40:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:40:40,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:40:40,551 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:40:40,551 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:40:40,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 23:40:40,555 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:40:40,615 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:40:40,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:40:40 BoogieIcfgContainer [2024-10-12 23:40:40,617 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:40:40,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:40:40,617 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:40:40,618 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:40:40,618 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:40:27" (3/4) ... [2024-10-12 23:40:40,619 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:40:40,620 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:40:40,620 INFO L158 Benchmark]: Toolchain (without parser) took 19098.21ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 94.7MB in the beginning and 956.3MB in the end (delta: -861.6MB). Peak memory consumption was 659.3MB. Max. memory is 16.1GB. [2024-10-12 23:40:40,621 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 167.8MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:40:40,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 667.23ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 64.0MB in the end (delta: 30.6MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-10-12 23:40:40,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 455.48ms. Allocated memory was 167.8MB in the beginning and 266.3MB in the end (delta: 98.6MB). Free memory was 64.0MB in the beginning and 131.1MB in the end (delta: -67.1MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2024-10-12 23:40:40,621 INFO L158 Benchmark]: Boogie Preprocessor took 612.58ms. Allocated memory is still 266.3MB. Free memory was 131.1MB in the beginning and 138.6MB in the end (delta: -7.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-12 23:40:40,621 INFO L158 Benchmark]: RCFGBuilder took 3988.37ms. Allocated memory was 266.3MB in the beginning and 687.9MB in the end (delta: 421.5MB). Free memory was 138.6MB in the beginning and 346.1MB in the end (delta: -207.5MB). Peak memory consumption was 220.2MB. Max. memory is 16.1GB. [2024-10-12 23:40:40,622 INFO L158 Benchmark]: TraceAbstraction took 13365.24ms. Allocated memory was 687.9MB in the beginning and 1.7GB in the end (delta: 998.2MB). Free memory was 346.1MB in the beginning and 956.3MB in the end (delta: -610.2MB). Peak memory consumption was 389.0MB. Max. memory is 16.1GB. [2024-10-12 23:40:40,622 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 1.7GB. Free memory is still 956.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:40:40,623 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.09ms. Allocated memory is still 167.8MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 667.23ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 64.0MB in the end (delta: 30.6MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 455.48ms. Allocated memory was 167.8MB in the beginning and 266.3MB in the end (delta: 98.6MB). Free memory was 64.0MB in the beginning and 131.1MB in the end (delta: -67.1MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 612.58ms. Allocated memory is still 266.3MB. Free memory was 131.1MB in the beginning and 138.6MB in the end (delta: -7.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * RCFGBuilder took 3988.37ms. Allocated memory was 266.3MB in the beginning and 687.9MB in the end (delta: 421.5MB). Free memory was 138.6MB in the beginning and 346.1MB in the end (delta: -207.5MB). Peak memory consumption was 220.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13365.24ms. Allocated memory was 687.9MB in the beginning and 1.7GB in the end (delta: 998.2MB). Free memory was 346.1MB in the beginning and 956.3MB in the end (delta: -610.2MB). Peak memory consumption was 389.0MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 1.7GB. Free memory is still 956.3MB. 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 409. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_26 = 2; [L46] const SORT_21 var_29 = 4; [L47] const SORT_21 var_33 = 8; [L48] const SORT_21 var_37 = 0; [L49] const SORT_21 var_46 = 16; [L50] const SORT_21 var_49 = 32; [L51] const SORT_21 var_52 = 64; [L52] const SORT_3 var_57 = 1; [L53] const SORT_3 var_61 = 0; [L54] const SORT_6 var_146 = 0; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_368; [L72] SORT_3 input_390; [L73] SORT_3 input_405; [L74] SORT_3 input_420; [L75] SORT_3 input_435; [L76] SORT_3 input_450; [L77] SORT_3 input_465; [L78] SORT_3 input_480; [L79] SORT_3 input_495; [L80] SORT_3 input_510; [L81] SORT_3 input_525; [L82] SORT_3 input_540; [L83] SORT_3 input_555; [L84] SORT_3 input_570; [L85] SORT_3 input_585; [L86] SORT_3 input_600; [L87] SORT_3 input_616; [L88] SORT_3 input_618; [L89] SORT_3 input_620; [L90] SORT_3 input_622; [L91] SORT_3 input_624; [L92] SORT_3 input_626; [L93] SORT_3 input_628; [L94] SORT_3 input_630; [L95] SORT_3 input_635; [L96] SORT_21 input_676; [L97] SORT_21 input_677; [L98] SORT_21 input_678; [L99] SORT_21 input_679; [L100] SORT_21 input_682; [L101] SORT_21 input_686; [L102] SORT_21 input_690; [L103] SORT_21 input_698; [L104] SORT_21 input_702; [L105] SORT_21 input_704; [L106] SORT_21 input_708; [L107] SORT_21 input_711; [L108] SORT_21 input_715; [L109] SORT_21 input_720; [L110] SORT_21 input_724; [L111] SORT_21 input_729; [L112] SORT_21 input_731; [L113] SORT_21 input_732; [L114] SORT_21 input_734; [L115] SORT_21 input_738; [L116] SORT_21 input_743; [L117] SORT_21 input_750; [L118] SORT_21 input_751; [L119] SORT_21 input_753; [L120] SORT_21 input_757; [L121] SORT_21 input_762; [L122] SORT_21 input_764; [L123] SORT_21 input_765; [L124] SORT_21 input_767; [L125] SORT_21 input_771; [L126] SORT_21 input_776; [L127] SORT_21 input_780; [L128] SORT_21 input_785; [L129] SORT_21 input_787; [L130] SORT_21 input_793; [L131] SORT_21 input_805; [L132] SORT_3 input_810; [L133] SORT_3 input_819; [L134] SORT_3 input_838; [L135] SORT_3 input_845; [L136] SORT_3 input_856; [L137] SORT_3 input_862; [L138] SORT_3 input_868; [L139] SORT_3 input_874; [L140] SORT_3 input_880; [L141] SORT_3 input_886; [L142] SORT_3 input_892; [L143] SORT_3 input_898; [L144] SORT_3 input_904; [L145] SORT_3 input_910; [L146] SORT_3 input_916; [L147] SORT_3 input_922; [L148] SORT_3 input_928; [L150] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L151] SORT_21 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L152] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L152] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L153] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L153] SORT_3 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L154] SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L155] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L155] SORT_3 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L156] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L156] SORT_3 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L157] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L157] SORT_3 state_78 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L158] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L158] SORT_3 state_94 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L159] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L159] SORT_3 state_111 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L160] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L160] SORT_3 state_114 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L161] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L161] SORT_3 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L162] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L162] SORT_3 state_120 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L163] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L163] SORT_3 state_124 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L164] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L164] SORT_3 state_129 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L165] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L165] SORT_3 state_132 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L166] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L166] SORT_3 state_142 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L167] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L167] SORT_3 state_149 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L168] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L168] SORT_3 state_152 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L169] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L169] SORT_3 state_161 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L170] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L170] SORT_3 state_166 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L171] SORT_3 state_169 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L172] SORT_3 state_181 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L173] SORT_3 state_191 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L174] SORT_3 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L175] SORT_3 state_199 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L176] SORT_3 state_208 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L177] SORT_3 state_221 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L178] SORT_3 state_234 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_21 init_32_arg_1 = var_22; [L183] state_31 = init_32_arg_1 [L184] SORT_3 init_63_arg_1 = var_61; [L185] state_62 = init_63_arg_1 [L186] SORT_3 init_65_arg_1 = var_61; [L187] state_64 = init_65_arg_1 [L188] SORT_3 init_67_arg_1 = var_61; [L189] state_66 = init_67_arg_1 [L190] SORT_3 init_71_arg_1 = var_61; [L191] state_70 = init_71_arg_1 [L192] SORT_3 init_75_arg_1 = var_61; [L193] state_74 = init_75_arg_1 [L194] SORT_3 init_79_arg_1 = var_61; [L195] state_78 = init_79_arg_1 [L196] SORT_3 init_95_arg_1 = var_61; [L197] state_94 = init_95_arg_1 [L198] SORT_3 init_112_arg_1 = var_61; [L199] state_111 = init_112_arg_1 [L200] SORT_3 init_115_arg_1 = var_61; [L201] state_114 = init_115_arg_1 [L202] SORT_3 init_117_arg_1 = var_61; [L203] state_116 = init_117_arg_1 [L204] SORT_3 init_121_arg_1 = var_61; [L205] state_120 = init_121_arg_1 [L206] SORT_3 init_125_arg_1 = var_61; [L207] state_124 = init_125_arg_1 [L208] SORT_3 init_130_arg_1 = var_61; [L209] state_129 = init_130_arg_1 [L210] SORT_3 init_133_arg_1 = var_61; [L211] state_132 = init_133_arg_1 [L212] SORT_3 init_143_arg_1 = var_61; [L213] state_142 = init_143_arg_1 [L214] SORT_3 init_150_arg_1 = var_61; [L215] state_149 = init_150_arg_1 [L216] SORT_3 init_153_arg_1 = var_61; [L217] state_152 = init_153_arg_1 [L218] SORT_3 init_162_arg_1 = var_61; [L219] state_161 = init_162_arg_1 [L220] SORT_3 init_167_arg_1 = var_61; [L221] state_166 = init_167_arg_1 [L222] SORT_3 init_170_arg_1 = var_61; [L223] state_169 = init_170_arg_1 [L224] SORT_3 init_182_arg_1 = var_61; [L225] state_181 = init_182_arg_1 [L226] SORT_3 init_192_arg_1 = var_61; [L227] state_191 = init_192_arg_1 [L228] SORT_3 init_197_arg_1 = var_61; [L229] state_196 = init_197_arg_1 [L230] SORT_3 init_200_arg_1 = var_61; [L231] state_199 = init_200_arg_1 [L232] SORT_3 init_209_arg_1 = var_61; [L233] state_208 = init_209_arg_1 [L234] SORT_3 init_222_arg_1 = var_61; [L235] state_221 = init_222_arg_1 [L236] SORT_3 init_235_arg_1 = var_61; [L237] state_234 = init_235_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_368 = __VERIFIER_nondet_uchar() [L257] input_390 = __VERIFIER_nondet_uchar() [L258] input_405 = __VERIFIER_nondet_uchar() [L259] input_420 = __VERIFIER_nondet_uchar() [L260] input_435 = __VERIFIER_nondet_uchar() [L261] input_450 = __VERIFIER_nondet_uchar() [L262] input_465 = __VERIFIER_nondet_uchar() [L263] input_480 = __VERIFIER_nondet_uchar() [L264] input_495 = __VERIFIER_nondet_uchar() [L265] input_510 = __VERIFIER_nondet_uchar() [L266] input_525 = __VERIFIER_nondet_uchar() [L267] input_540 = __VERIFIER_nondet_uchar() [L268] input_555 = __VERIFIER_nondet_uchar() [L269] input_570 = __VERIFIER_nondet_uchar() [L270] input_585 = __VERIFIER_nondet_uchar() [L271] input_600 = __VERIFIER_nondet_uchar() [L272] input_616 = __VERIFIER_nondet_uchar() [L273] input_618 = __VERIFIER_nondet_uchar() [L274] input_620 = __VERIFIER_nondet_uchar() [L275] input_622 = __VERIFIER_nondet_uchar() [L276] input_624 = __VERIFIER_nondet_uchar() [L277] input_626 = __VERIFIER_nondet_uchar() [L278] input_628 = __VERIFIER_nondet_uchar() [L279] input_630 = __VERIFIER_nondet_uchar() [L280] input_635 = __VERIFIER_nondet_uchar() [L281] input_676 = __VERIFIER_nondet_uchar() [L282] input_677 = __VERIFIER_nondet_uchar() [L283] input_678 = __VERIFIER_nondet_uchar() [L284] input_679 = __VERIFIER_nondet_uchar() [L285] input_682 = __VERIFIER_nondet_uchar() [L286] input_686 = __VERIFIER_nondet_uchar() [L287] input_690 = __VERIFIER_nondet_uchar() [L288] input_698 = __VERIFIER_nondet_uchar() [L289] input_702 = __VERIFIER_nondet_uchar() [L290] input_704 = __VERIFIER_nondet_uchar() [L291] input_708 = __VERIFIER_nondet_uchar() [L292] input_711 = __VERIFIER_nondet_uchar() [L293] input_715 = __VERIFIER_nondet_uchar() [L294] input_720 = __VERIFIER_nondet_uchar() [L295] input_724 = __VERIFIER_nondet_uchar() [L296] input_729 = __VERIFIER_nondet_uchar() [L297] input_731 = __VERIFIER_nondet_uchar() [L298] input_732 = __VERIFIER_nondet_uchar() [L299] input_734 = __VERIFIER_nondet_uchar() [L300] input_738 = __VERIFIER_nondet_uchar() [L301] input_743 = __VERIFIER_nondet_uchar() [L302] input_750 = __VERIFIER_nondet_uchar() [L303] input_751 = __VERIFIER_nondet_uchar() [L304] input_753 = __VERIFIER_nondet_uchar() [L305] input_757 = __VERIFIER_nondet_uchar() [L306] input_762 = __VERIFIER_nondet_uchar() [L307] input_764 = __VERIFIER_nondet_uchar() [L308] input_765 = __VERIFIER_nondet_uchar() [L309] input_767 = __VERIFIER_nondet_uchar() [L310] input_771 = __VERIFIER_nondet_uchar() [L311] input_776 = __VERIFIER_nondet_uchar() [L312] input_780 = __VERIFIER_nondet_uchar() [L313] input_785 = __VERIFIER_nondet_uchar() [L314] input_787 = __VERIFIER_nondet_uchar() [L315] input_793 = __VERIFIER_nondet_uchar() [L316] input_805 = __VERIFIER_nondet_uchar() [L317] input_810 = __VERIFIER_nondet_uchar() [L318] input_819 = __VERIFIER_nondet_uchar() [L319] input_838 = __VERIFIER_nondet_uchar() [L320] input_845 = __VERIFIER_nondet_uchar() [L321] input_856 = __VERIFIER_nondet_uchar() [L322] input_862 = __VERIFIER_nondet_uchar() [L323] input_868 = __VERIFIER_nondet_uchar() [L324] input_874 = __VERIFIER_nondet_uchar() [L325] input_880 = __VERIFIER_nondet_uchar() [L326] input_886 = __VERIFIER_nondet_uchar() [L327] input_892 = __VERIFIER_nondet_uchar() [L328] input_898 = __VERIFIER_nondet_uchar() [L329] input_904 = __VERIFIER_nondet_uchar() [L330] input_910 = __VERIFIER_nondet_uchar() [L331] input_916 = __VERIFIER_nondet_uchar() [L332] input_922 = __VERIFIER_nondet_uchar() [L333] input_928 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_27_arg_0 = state_23; [L340] SORT_21 var_27_arg_1 = var_26; [L341] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L342] SORT_3 var_28_arg_0 = var_25; [L343] SORT_3 var_28_arg_1 = var_27; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28_arg_0=1, var_28_arg_1=0, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L344] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L344] SORT_3 var_28 = var_28_arg_0 | var_28_arg_1; [L345] SORT_21 var_30_arg_0 = state_23; [L346] SORT_21 var_30_arg_1 = var_29; [L347] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L348] SORT_21 var_34_arg_0 = state_31; [L349] SORT_21 var_34_arg_1 = var_33; [L350] SORT_3 var_34 = var_34_arg_0 == var_34_arg_1; [L351] SORT_21 var_35_arg_0 = state_31; [L352] SORT_21 var_35_arg_1 = var_22; [L353] SORT_3 var_35 = var_35_arg_0 == var_35_arg_1; [L354] SORT_3 var_36_arg_0 = var_34; [L355] SORT_3 var_36_arg_1 = var_35; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_36_arg_0=0, var_36_arg_1=1, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L356] EXPR var_36_arg_0 | var_36_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L356] SORT_3 var_36 = var_36_arg_0 | var_36_arg_1; [L357] SORT_21 var_38_arg_0 = state_31; [L358] SORT_21 var_38_arg_1 = var_37; [L359] SORT_3 var_38 = var_38_arg_0 == var_38_arg_1; [L360] SORT_3 var_39_arg_0 = var_36; [L361] SORT_3 var_39_arg_1 = var_38; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_39_arg_0=1, var_39_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L362] EXPR var_39_arg_0 | var_39_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L362] SORT_3 var_39 = var_39_arg_0 | var_39_arg_1; [L363] SORT_21 var_40_arg_0 = state_31; [L364] SORT_21 var_40_arg_1 = var_29; [L365] SORT_3 var_40 = var_40_arg_0 == var_40_arg_1; [L366] SORT_3 var_41_arg_0 = var_39; [L367] SORT_3 var_41_arg_1 = var_40; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_41_arg_0=1, var_41_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L368] EXPR var_41_arg_0 | var_41_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L368] SORT_3 var_41 = var_41_arg_0 | var_41_arg_1; [L369] SORT_3 var_42_arg_0 = var_30; [L370] SORT_3 var_42_arg_1 = var_41; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_33=8, var_37=0, var_42_arg_0=0, var_42_arg_1=1, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L371] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L371] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_28; [L373] SORT_3 var_43_arg_1 = var_42; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_43_arg_0=1, var_43_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L374] EXPR var_43_arg_0 | var_43_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L374] SORT_3 var_43 = var_43_arg_0 | var_43_arg_1; [L375] SORT_21 var_44_arg_0 = state_23; [L376] SORT_21 var_44_arg_1 = var_33; [L377] SORT_3 var_44 = var_44_arg_0 == var_44_arg_1; [L378] SORT_3 var_45_arg_0 = var_43; [L379] SORT_3 var_45_arg_1 = var_44; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_45_arg_0=1, var_45_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L380] EXPR var_45_arg_0 | var_45_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L380] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L381] SORT_21 var_47_arg_0 = state_23; [L382] SORT_21 var_47_arg_1 = var_46; [L383] SORT_3 var_47 = var_47_arg_0 == var_47_arg_1; [L384] SORT_3 var_48_arg_0 = var_45; [L385] SORT_3 var_48_arg_1 = var_47; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_48_arg_0=1, var_48_arg_1=0, var_49=32, var_52=64, var_57=1, var_61=0] [L386] EXPR var_48_arg_0 | var_48_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L386] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L387] SORT_21 var_50_arg_0 = state_23; [L388] SORT_21 var_50_arg_1 = var_49; [L389] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L390] SORT_3 var_51_arg_0 = var_48; [L391] SORT_3 var_51_arg_1 = var_50; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_51_arg_0=1, var_51_arg_1=0, var_52=64, var_57=1, var_61=0] [L392] EXPR var_51_arg_0 | var_51_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L392] SORT_3 var_51 = var_51_arg_0 | var_51_arg_1; [L393] SORT_21 var_53_arg_0 = state_23; [L394] SORT_21 var_53_arg_1 = var_52; [L395] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L396] SORT_3 var_54_arg_0 = var_51; [L397] SORT_3 var_54_arg_1 = var_53; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_54_arg_0=1, var_54_arg_1=0, var_57=1, var_61=0] [L398] EXPR var_54_arg_0 | var_54_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L398] SORT_3 var_54 = var_54_arg_0 | var_54_arg_1; [L399] SORT_21 var_55_arg_0 = state_23; [L400] SORT_21 var_55_arg_1 = var_37; [L401] SORT_3 var_55 = var_55_arg_0 == var_55_arg_1; [L402] SORT_3 var_56_arg_0 = var_54; [L403] SORT_3 var_56_arg_1 = var_55; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_56_arg_0=1, var_56_arg_1=0, var_57=1, var_61=0] [L404] EXPR var_56_arg_0 | var_56_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L404] SORT_3 var_56 = var_56_arg_0 | var_56_arg_1; [L405] SORT_3 var_58_arg_0 = var_56; [L406] SORT_3 var_58 = ~var_58_arg_0; [L407] SORT_3 var_59_arg_0 = var_57; [L408] SORT_3 var_59_arg_1 = var_58; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_59_arg_0=1, var_59_arg_1=-2, var_61=0] [L409] EXPR var_59_arg_0 & var_59_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L409] SORT_3 var_59 = var_59_arg_0 & var_59_arg_1; [L410] EXPR var_59 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L410] var_59 = var_59 & mask_SORT_3 [L411] SORT_3 bad_60_arg_0 = var_59; [L412] CALL __VERIFIER_assert(!(bad_60_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26134 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26134 mSDsluCounter, 135024 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108370 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2372 IncrementalHoareTripleChecker+Invalid, 2387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 26654 mSDtfsCounter, 2372 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1214occurred in iteration=16, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1866 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1639 NumberOfCodeBlocks, 1639 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1521 ConstructedInterpolants, 0 QuantifiedInterpolants, 7694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-10-12 23:40:40,654 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.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 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:40:43,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:40:43,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 23:40:43,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:40:43,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:40:43,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:40:43,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:40:43,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:40:43,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:40:43,162 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:40:43,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:40:43,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:40:43,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:40:43,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:40:43,163 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:40:43,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:40:43,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:40:43,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:40:43,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:40:43,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:40:43,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:40:43,167 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:40:43,167 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:40:43,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:40:43,167 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:40:43,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:40:43,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:40:43,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:40:43,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:40:43,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:40:43,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:40:43,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:40:43,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:40:43,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:40:43,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:40:43,169 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:40:43,169 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:40:43,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:40:43,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:40:43,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:40:43,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:40:43,170 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:40:43,170 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 -> 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f [2024-10-12 23:40:43,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:40:43,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:40:43,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:40:43,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:40:43,464 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:40:43,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-10-12 23:40:44,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:40:45,084 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:40:45,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-10-12 23:40:45,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8665d9eac/601c8f689baf4b6a841aea7e5d42ed54/FLAGe8f5012e7 [2024-10-12 23:40:45,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8665d9eac/601c8f689baf4b6a841aea7e5d42ed54 [2024-10-12 23:40:45,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:40:45,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:40:45,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:40:45,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:40:45,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:40:45,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:45,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c8c606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45, skipping insertion in model container [2024-10-12 23:40:45,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:45,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:40:45,459 WARN L248 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281] [2024-10-12 23:40:45,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:40:45,721 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:40:45,730 WARN L248 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281] [2024-10-12 23:40:45,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:40:45,892 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:40:45,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45 WrapperNode [2024-10-12 23:40:45,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:40:45,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:40:45,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:40:45,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:40:45,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:45,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:46,077 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2641 [2024-10-12 23:40:46,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:40:46,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:40:46,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:40:46,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:40:46,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:46,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:46,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:46,189 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:40:46,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:46,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:46,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:46,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:46,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:46,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:46,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:40:46,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:40:46,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:40:46,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:40:46,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (1/1) ... [2024-10-12 23:40:46,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:40:46,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:40:46,300 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-10-12 23:40:46,314 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-10-12 23:40:46,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:40:46,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:40:46,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:40:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:40:46,764 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:40:46,766 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:40:48,776 INFO L? ?]: Removed 183 outVars from TransFormulas that were not future-live. [2024-10-12 23:40:48,776 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:40:48,861 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:40:48,861 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:40:48,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:40:48 BoogieIcfgContainer [2024-10-12 23:40:48,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:40:48,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:40:48,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:40:48,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:40:48,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:40:45" (1/3) ... [2024-10-12 23:40:48,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658669e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:40:48, skipping insertion in model container [2024-10-12 23:40:48,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:40:45" (2/3) ... [2024-10-12 23:40:48,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658669e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:40:48, skipping insertion in model container [2024-10-12 23:40:48,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:40:48" (3/3) ... [2024-10-12 23:40:48,872 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-10-12 23:40:48,885 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:40:48,885 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:40:48,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:40:48,934 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;@1bc8c641, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:40:48,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:40:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-10-12 23:40:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 23:40:48,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:48,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 23:40:48,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:48,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 23:40:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:40:48,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437574683] [2024-10-12 23:40:48,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:48,962 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-10-12 23:40:48,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:40:48,965 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-10-12 23:40:48,966 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-10-12 23:40:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:49,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 23:40:49,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:40:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:49,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:40:49,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:40:49,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437574683] [2024-10-12 23:40:49,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437574683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:40:49,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:40:49,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:40:49,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190563195] [2024-10-12 23:40:49,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:40:49,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:40:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:40:49,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:40:49,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:40:49,580 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-12 23:40:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:49,648 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-12 23:40:49,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:40:49,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-12 23:40:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:49,655 INFO L225 Difference]: With dead ends: 14 [2024-10-12 23:40:49,656 INFO L226 Difference]: Without dead ends: 8 [2024-10-12 23:40:49,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-12 23:40:49,660 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:49,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:40:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-12 23:40:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-12 23:40:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-10-12 23:40:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 23:40:49,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 23:40:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:49,679 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 23:40:49,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-12 23:40:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 23:40:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 23:40:49,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:49,680 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 23:40:49,685 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-10-12 23:40:49,881 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-10-12 23:40:49,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:49,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:49,883 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 23:40:49,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:40:49,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321838480] [2024-10-12 23:40:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:40:49,885 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-10-12 23:40:49,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:40:49,887 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-10-12 23:40:49,889 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-10-12 23:40:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:40:50,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-12 23:40:50,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:40:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:50,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:40:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:40:54,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:40:54,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321838480] [2024-10-12 23:40:54,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321838480] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:40:54,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:40:54,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 23:40:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693694142] [2024-10-12 23:40:54,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:40:54,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:40:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:40:54,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:40:54,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2024-10-12 23:40:54,992 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:40:55,184 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-12 23:40:55,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:40:55,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-12 23:40:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:40:55,185 INFO L225 Difference]: With dead ends: 13 [2024-10-12 23:40:55,185 INFO L226 Difference]: Without dead ends: 11 [2024-10-12 23:40:55,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2024-10-12 23:40:55,187 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:40:55,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:40:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-12 23:40:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-12 23:40:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-10-12 23:40:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-12 23:40:55,191 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-12 23:40:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:40:55,192 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-12 23:40:55,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:40:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-12 23:40:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 23:40:55,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:40:55,193 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-12 23:40:55,247 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-10-12 23:40:55,397 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-10-12 23:40:55,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:40:55,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:40:55,399 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-12 23:40:55,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:40:55,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007863925] [2024-10-12 23:40:55,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 23:40:55,401 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-10-12 23:40:55,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:40:55,402 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-10-12 23:40:55,407 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-10-12 23:40:56,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 23:40:56,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 23:40:56,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-12 23:40:56,453 INFO L278 TraceCheckSpWp]: Computing forward predicates...