./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.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 ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:13:34,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:13:34,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 19:13:34,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:13:34,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:13:34,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:13:34,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:13:34,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:13:34,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:13:34,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:13:34,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:13:34,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:13:34,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:13:34,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:13:34,195 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:13:34,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:13:34,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:13:34,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:13:34,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:13:34,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:13:34,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:13:34,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:13:34,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:13:34,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:13:34,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:13:34,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:13:34,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:13:34,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:13:34,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:13:34,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:34,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:13:34,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:13:34,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:13:34,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:13:34,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:13:34,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:13:34,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:13:34,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:13:34,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:13:34,202 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 -> ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e [2024-11-08 19:13:34,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:13:34,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:13:34,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:13:34,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:13:34,437 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:13:34,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2024-11-08 19:13:35,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:13:36,087 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:13:36,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2024-11-08 19:13:36,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918228a39/ca85efc57024474a916dff2511a2f756/FLAGdd81537a7 [2024-11-08 19:13:36,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918228a39/ca85efc57024474a916dff2511a2f756 [2024-11-08 19:13:36,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:13:36,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:13:36,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:36,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:13:36,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:13:36,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:36,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ae98da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36, skipping insertion in model container [2024-11-08 19:13:36,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:36,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:13:36,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c[1268,1281] [2024-11-08 19:13:36,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:36,774 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:13:36,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c[1268,1281] [2024-11-08 19:13:36,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:36,944 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:13:36,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36 WrapperNode [2024-11-08 19:13:36,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:36,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:36,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:13:36,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:13:36,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:36,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,418 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4813 [2024-11-08 19:13:37,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:37,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:13:37,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:13:37,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:13:37,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,819 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:13:37,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:38,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:13:38,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:13:38,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:13:38,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:13:38,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:38,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:38,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:13:38,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:13:38,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:13:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:13:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:13:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:13:38,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:13:38,463 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:13:38,465 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:13:41,569 INFO L? ?]: Removed 3115 outVars from TransFormulas that were not future-live. [2024-11-08 19:13:41,570 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:13:41,601 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:13:41,602 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:13:41,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:41 BoogieIcfgContainer [2024-11-08 19:13:41,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:13:41,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:13:41,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:13:41,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:13:41,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:13:36" (1/3) ... [2024-11-08 19:13:41,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7d722b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:13:41, skipping insertion in model container [2024-11-08 19:13:41,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (2/3) ... [2024-11-08 19:13:41,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7d722b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:13:41, skipping insertion in model container [2024-11-08 19:13:41,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:41" (3/3) ... [2024-11-08 19:13:41,609 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2024-11-08 19:13:41,622 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:13:41,623 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:13:41,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:13:41,701 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;@38c143c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:13:41,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:13:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 1110 states, 1108 states have (on average 1.4990974729241877) internal successors, (1661), 1109 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 19:13:41,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:41,716 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] [2024-11-08 19:13:41,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:41,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:41,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1132341910, now seen corresponding path program 1 times [2024-11-08 19:13:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:41,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921042468] [2024-11-08 19:13:41,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:41,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:42,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:42,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:42,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921042468] [2024-11-08 19:13:42,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921042468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:42,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:42,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:13:42,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184525923] [2024-11-08 19:13:42,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:42,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:42,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:42,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:42,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:42,474 INFO L87 Difference]: Start difference. First operand has 1110 states, 1108 states have (on average 1.4990974729241877) internal successors, (1661), 1109 states have internal predecessors, (1661), 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 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:42,570 INFO L93 Difference]: Finished difference Result 2101 states and 3147 transitions. [2024-11-08 19:13:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:13:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2024-11-08 19:13:42,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:42,587 INFO L225 Difference]: With dead ends: 2101 [2024-11-08 19:13:42,587 INFO L226 Difference]: Without dead ends: 1109 [2024-11-08 19:13:42,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:42,598 INFO L432 NwaCegarLoop]: 1655 mSDtfsCounter, 0 mSDsluCounter, 3304 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4959 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:42,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4959 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:13:42,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-11-08 19:13:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2024-11-08 19:13:42,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1108 states have (on average 1.4972924187725631) internal successors, (1659), 1108 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1659 transitions. [2024-11-08 19:13:42,664 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1659 transitions. Word has length 81 [2024-11-08 19:13:42,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:42,665 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1659 transitions. [2024-11-08 19:13:42,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1659 transitions. [2024-11-08 19:13:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 19:13:42,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:42,667 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] [2024-11-08 19:13:42,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:13:42,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:42,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:42,668 INFO L85 PathProgramCache]: Analyzing trace with hash 744556489, now seen corresponding path program 1 times [2024-11-08 19:13:42,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:42,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129715860] [2024-11-08 19:13:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:42,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:42,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129715860] [2024-11-08 19:13:42,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129715860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:42,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:42,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:13:42,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956508302] [2024-11-08 19:13:42,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:42,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:42,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:42,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:42,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:42,902 INFO L87 Difference]: Start difference. First operand 1109 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:42,950 INFO L93 Difference]: Finished difference Result 2102 states and 3145 transitions. [2024-11-08 19:13:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:13:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 82 [2024-11-08 19:13:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:42,955 INFO L225 Difference]: With dead ends: 2102 [2024-11-08 19:13:42,955 INFO L226 Difference]: Without dead ends: 1111 [2024-11-08 19:13:42,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:42,959 INFO L432 NwaCegarLoop]: 1655 mSDtfsCounter, 0 mSDsluCounter, 3300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4955 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:42,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4955 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:13:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2024-11-08 19:13:42,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2024-11-08 19:13:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1110 states have (on average 1.4963963963963964) internal successors, (1661), 1110 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1661 transitions. [2024-11-08 19:13:42,984 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1661 transitions. Word has length 82 [2024-11-08 19:13:42,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:42,986 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1661 transitions. [2024-11-08 19:13:42,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1661 transitions. [2024-11-08 19:13:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 19:13:42,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:42,991 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] [2024-11-08 19:13:42,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:13:42,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:42,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:42,992 INFO L85 PathProgramCache]: Analyzing trace with hash 508449231, now seen corresponding path program 1 times [2024-11-08 19:13:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:42,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178948599] [2024-11-08 19:13:42,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:44,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178948599] [2024-11-08 19:13:44,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178948599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:44,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:44,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:13:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377338764] [2024-11-08 19:13:44,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:44,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:13:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:44,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:13:44,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:13:44,085 INFO L87 Difference]: Start difference. First operand 1111 states and 1661 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:44,443 INFO L93 Difference]: Finished difference Result 2997 states and 4481 transitions. [2024-11-08 19:13:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:13:44,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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 83 [2024-11-08 19:13:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:44,450 INFO L225 Difference]: With dead ends: 2997 [2024-11-08 19:13:44,450 INFO L226 Difference]: Without dead ends: 2004 [2024-11-08 19:13:44,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:13:44,453 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 2930 mSDsluCounter, 9736 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2930 SdHoareTripleChecker+Valid, 11359 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:44,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2930 Valid, 11359 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:13:44,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2024-11-08 19:13:44,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1123. [2024-11-08 19:13:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.4955436720142603) internal successors, (1678), 1122 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1678 transitions. [2024-11-08 19:13:44,476 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1678 transitions. Word has length 83 [2024-11-08 19:13:44,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:44,476 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1678 transitions. [2024-11-08 19:13:44,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1678 transitions. [2024-11-08 19:13:44,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 19:13:44,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:44,478 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] [2024-11-08 19:13:44,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:13:44,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:44,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:44,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1954969637, now seen corresponding path program 1 times [2024-11-08 19:13:44,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:44,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744033247] [2024-11-08 19:13:44,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:44,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:45,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:45,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:45,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744033247] [2024-11-08 19:13:45,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744033247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:45,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:45,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:13:45,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873154923] [2024-11-08 19:13:45,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:45,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:13:45,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:45,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:13:45,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:13:45,099 INFO L87 Difference]: Start difference. First operand 1123 states and 1678 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:45,430 INFO L93 Difference]: Finished difference Result 2998 states and 4481 transitions. [2024-11-08 19:13:45,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:13:45,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 84 [2024-11-08 19:13:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:45,437 INFO L225 Difference]: With dead ends: 2998 [2024-11-08 19:13:45,437 INFO L226 Difference]: Without dead ends: 2005 [2024-11-08 19:13:45,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-11-08 19:13:45,440 INFO L432 NwaCegarLoop]: 1629 mSDtfsCounter, 4237 mSDsluCounter, 5838 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4237 SdHoareTripleChecker+Valid, 7467 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:45,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4237 Valid, 7467 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2024-11-08 19:13:45,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1133. [2024-11-08 19:13:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4946996466431095) internal successors, (1692), 1132 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1692 transitions. [2024-11-08 19:13:45,466 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1692 transitions. Word has length 84 [2024-11-08 19:13:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:45,467 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1692 transitions. [2024-11-08 19:13:45,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1692 transitions. [2024-11-08 19:13:45,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 19:13:45,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:45,469 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] [2024-11-08 19:13:45,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:13:45,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:45,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:45,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1044690580, now seen corresponding path program 1 times [2024-11-08 19:13:45,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:45,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961206786] [2024-11-08 19:13:45,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:45,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:45,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:45,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961206786] [2024-11-08 19:13:45,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961206786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:45,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:45,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:13:45,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443867789] [2024-11-08 19:13:45,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:45,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:13:45,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:45,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:13:45,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:13:45,932 INFO L87 Difference]: Start difference. First operand 1133 states and 1692 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:46,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:46,108 INFO L93 Difference]: Finished difference Result 3002 states and 4485 transitions. [2024-11-08 19:13:46,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:46,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2024-11-08 19:13:46,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:46,114 INFO L225 Difference]: With dead ends: 3002 [2024-11-08 19:13:46,115 INFO L226 Difference]: Without dead ends: 1998 [2024-11-08 19:13:46,118 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-11-08 19:13:46,119 INFO L432 NwaCegarLoop]: 1634 mSDtfsCounter, 4225 mSDsluCounter, 3263 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4225 SdHoareTripleChecker+Valid, 4897 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:46,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4225 Valid, 4897 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2024-11-08 19:13:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1128. [2024-11-08 19:13:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 1.4942324755989351) internal successors, (1684), 1127 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1684 transitions. [2024-11-08 19:13:46,144 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1684 transitions. Word has length 85 [2024-11-08 19:13:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:46,144 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1684 transitions. [2024-11-08 19:13:46,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1684 transitions. [2024-11-08 19:13:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 19:13:46,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:46,146 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] [2024-11-08 19:13:46,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:13:46,146 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:46,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:46,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1979140564, now seen corresponding path program 1 times [2024-11-08 19:13:46,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:46,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129482343] [2024-11-08 19:13:46,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:46,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:46,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:46,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129482343] [2024-11-08 19:13:46,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129482343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:46,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:46,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:13:46,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492598295] [2024-11-08 19:13:46,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:46,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:13:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:46,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:13:46,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:13:46,610 INFO L87 Difference]: Start difference. First operand 1128 states and 1684 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:46,874 INFO L93 Difference]: Finished difference Result 2996 states and 4475 transitions. [2024-11-08 19:13:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:13:46,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 85 [2024-11-08 19:13:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:46,881 INFO L225 Difference]: With dead ends: 2996 [2024-11-08 19:13:46,882 INFO L226 Difference]: Without dead ends: 1995 [2024-11-08 19:13:46,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:13:46,885 INFO L432 NwaCegarLoop]: 1632 mSDtfsCounter, 4220 mSDsluCounter, 6518 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4220 SdHoareTripleChecker+Valid, 8150 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:46,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4220 Valid, 8150 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:13:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2024-11-08 19:13:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1125. [2024-11-08 19:13:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.49288256227758) internal successors, (1678), 1124 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1678 transitions. [2024-11-08 19:13:46,980 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1678 transitions. Word has length 85 [2024-11-08 19:13:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:46,981 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1678 transitions. [2024-11-08 19:13:46,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1678 transitions. [2024-11-08 19:13:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 19:13:46,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:46,982 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] [2024-11-08 19:13:46,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:13:46,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:46,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash -357824823, now seen corresponding path program 1 times [2024-11-08 19:13:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:46,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64488549] [2024-11-08 19:13:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:46,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:47,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64488549] [2024-11-08 19:13:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64488549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:47,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:47,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:13:47,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098161135] [2024-11-08 19:13:47,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:47,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:13:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:47,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:13:47,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:13:47,372 INFO L87 Difference]: Start difference. First operand 1125 states and 1678 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:47,716 INFO L93 Difference]: Finished difference Result 2985 states and 4459 transitions. [2024-11-08 19:13:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:47,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2024-11-08 19:13:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:47,722 INFO L225 Difference]: With dead ends: 2985 [2024-11-08 19:13:47,722 INFO L226 Difference]: Without dead ends: 1992 [2024-11-08 19:13:47,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:13:47,725 INFO L432 NwaCegarLoop]: 1633 mSDtfsCounter, 4206 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4206 SdHoareTripleChecker+Valid, 4895 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:47,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4206 Valid, 4895 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:13:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2024-11-08 19:13:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1125. [2024-11-08 19:13:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.4919928825622777) internal successors, (1677), 1124 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1677 transitions. [2024-11-08 19:13:47,748 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1677 transitions. Word has length 86 [2024-11-08 19:13:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:47,748 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1677 transitions. [2024-11-08 19:13:47,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1677 transitions. [2024-11-08 19:13:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 19:13:47,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:47,749 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] [2024-11-08 19:13:47,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:13:47,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:47,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:47,750 INFO L85 PathProgramCache]: Analyzing trace with hash 924453349, now seen corresponding path program 1 times [2024-11-08 19:13:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:47,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460876357] [2024-11-08 19:13:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:48,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:48,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460876357] [2024-11-08 19:13:48,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460876357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:48,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:48,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 19:13:48,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028610389] [2024-11-08 19:13:48,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:48,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:13:48,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:13:48,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:13:48,170 INFO L87 Difference]: Start difference. First operand 1125 states and 1677 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:48,309 INFO L93 Difference]: Finished difference Result 2129 states and 3178 transitions. [2024-11-08 19:13:48,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:13:48,310 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 86 [2024-11-08 19:13:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:48,313 INFO L225 Difference]: With dead ends: 2129 [2024-11-08 19:13:48,313 INFO L226 Difference]: Without dead ends: 1136 [2024-11-08 19:13:48,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:13:48,316 INFO L432 NwaCegarLoop]: 1639 mSDtfsCounter, 1659 mSDsluCounter, 4936 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 6575 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:48,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 6575 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2024-11-08 19:13:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1128. [2024-11-08 19:13:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 1.4915705412599822) internal successors, (1681), 1127 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1681 transitions. [2024-11-08 19:13:48,335 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1681 transitions. Word has length 86 [2024-11-08 19:13:48,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:48,335 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1681 transitions. [2024-11-08 19:13:48,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:48,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1681 transitions. [2024-11-08 19:13:48,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 19:13:48,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:48,336 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] [2024-11-08 19:13:48,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:13:48,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:48,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash -352659839, now seen corresponding path program 1 times [2024-11-08 19:13:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:48,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847792193] [2024-11-08 19:13:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:48,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:48,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:48,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847792193] [2024-11-08 19:13:48,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847792193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:48,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:48,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 19:13:48,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464132408] [2024-11-08 19:13:48,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:48,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:13:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:48,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:13:48,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:13:48,859 INFO L87 Difference]: Start difference. First operand 1128 states and 1681 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:48,990 INFO L93 Difference]: Finished difference Result 2129 states and 3178 transitions. [2024-11-08 19:13:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:13:48,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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 87 [2024-11-08 19:13:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:48,993 INFO L225 Difference]: With dead ends: 2129 [2024-11-08 19:13:48,994 INFO L226 Difference]: Without dead ends: 1136 [2024-11-08 19:13:48,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:13:48,995 INFO L432 NwaCegarLoop]: 1641 mSDtfsCounter, 1590 mSDsluCounter, 9811 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 11452 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:48,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 11452 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:48,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2024-11-08 19:13:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1134. [2024-11-08 19:13:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1133 states have (on average 1.4907325684024713) internal successors, (1689), 1133 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1689 transitions. [2024-11-08 19:13:49,012 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1689 transitions. Word has length 87 [2024-11-08 19:13:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:49,013 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1689 transitions. [2024-11-08 19:13:49,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1689 transitions. [2024-11-08 19:13:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 19:13:49,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:49,014 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] [2024-11-08 19:13:49,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:13:49,014 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:49,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:49,014 INFO L85 PathProgramCache]: Analyzing trace with hash 200195173, now seen corresponding path program 1 times [2024-11-08 19:13:49,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:49,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809845914] [2024-11-08 19:13:49,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:49,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:49,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:49,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809845914] [2024-11-08 19:13:49,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809845914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:49,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:49,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:13:49,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402236325] [2024-11-08 19:13:49,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:49,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:13:49,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:49,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:13:49,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:13:49,263 INFO L87 Difference]: Start difference. First operand 1134 states and 1689 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:49,420 INFO L93 Difference]: Finished difference Result 3002 states and 4480 transitions. [2024-11-08 19:13:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:49,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2024-11-08 19:13:49,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:49,428 INFO L225 Difference]: With dead ends: 3002 [2024-11-08 19:13:49,429 INFO L226 Difference]: Without dead ends: 2003 [2024-11-08 19:13:49,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:13:49,431 INFO L432 NwaCegarLoop]: 1633 mSDtfsCounter, 4197 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4197 SdHoareTripleChecker+Valid, 4895 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:49,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4197 Valid, 4895 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:49,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2024-11-08 19:13:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1134. [2024-11-08 19:13:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1133 states have (on average 1.4898499558693734) internal successors, (1688), 1133 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-11-08 19:13:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1688 transitions. [2024-11-08 19:13:49,450 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1688 transitions. Word has length 87 [2024-11-08 19:13:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:49,450 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1688 transitions. [2024-11-08 19:13:49,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1688 transitions. [2024-11-08 19:13:49,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 19:13:49,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:49,451 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] [2024-11-08 19:13:49,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 19:13:49,452 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:49,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:49,452 INFO L85 PathProgramCache]: Analyzing trace with hash -777974822, now seen corresponding path program 1 times [2024-11-08 19:13:49,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:49,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802706709] [2024-11-08 19:13:49,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:49,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:50,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:50,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802706709] [2024-11-08 19:13:50,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802706709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:50,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:50,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 19:13:50,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654041188] [2024-11-08 19:13:50,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:50,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 19:13:50,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:50,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 19:13:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:13:50,410 INFO L87 Difference]: Start difference. First operand 1134 states and 1688 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:50,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:50,715 INFO L93 Difference]: Finished difference Result 2153 states and 3211 transitions. [2024-11-08 19:13:50,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 19:13:50,715 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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 88 [2024-11-08 19:13:50,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:50,719 INFO L225 Difference]: With dead ends: 2153 [2024-11-08 19:13:50,719 INFO L226 Difference]: Without dead ends: 1154 [2024-11-08 19:13:50,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:13:50,721 INFO L432 NwaCegarLoop]: 1633 mSDtfsCounter, 8 mSDsluCounter, 19562 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21195 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:50,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21195 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:13:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-08 19:13:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1148. [2024-11-08 19:13:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4908456843940714) internal successors, (1710), 1147 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1710 transitions. [2024-11-08 19:13:50,737 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1710 transitions. Word has length 88 [2024-11-08 19:13:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:50,738 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1710 transitions. [2024-11-08 19:13:50,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1710 transitions. [2024-11-08 19:13:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 19:13:50,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:50,738 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] [2024-11-08 19:13:50,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 19:13:50,739 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:50,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:50,739 INFO L85 PathProgramCache]: Analyzing trace with hash -901214846, now seen corresponding path program 1 times [2024-11-08 19:13:50,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:50,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402656673] [2024-11-08 19:13:50,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:50,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:51,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:51,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402656673] [2024-11-08 19:13:51,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402656673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:51,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:51,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 19:13:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260153626] [2024-11-08 19:13:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:51,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:13:51,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:51,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:13:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:13:51,583 INFO L87 Difference]: Start difference. First operand 1148 states and 1710 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:51,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:51,803 INFO L93 Difference]: Finished difference Result 2164 states and 3228 transitions. [2024-11-08 19:13:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 19:13:51,804 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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 88 [2024-11-08 19:13:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:51,807 INFO L225 Difference]: With dead ends: 2164 [2024-11-08 19:13:51,807 INFO L226 Difference]: Without dead ends: 1151 [2024-11-08 19:13:51,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:13:51,809 INFO L432 NwaCegarLoop]: 1640 mSDtfsCounter, 6 mSDsluCounter, 14721 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16361 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:51,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16361 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:13:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-08 19:13:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1148. [2024-11-08 19:13:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4899738448125546) internal successors, (1709), 1147 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1709 transitions. [2024-11-08 19:13:51,841 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1709 transitions. Word has length 88 [2024-11-08 19:13:51,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:51,844 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1709 transitions. [2024-11-08 19:13:51,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1709 transitions. [2024-11-08 19:13:51,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 19:13:51,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:51,846 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] [2024-11-08 19:13:51,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 19:13:51,846 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:51,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:51,846 INFO L85 PathProgramCache]: Analyzing trace with hash 71591773, now seen corresponding path program 1 times [2024-11-08 19:13:51,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:51,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574779218] [2024-11-08 19:13:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:52,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:52,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574779218] [2024-11-08 19:13:52,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574779218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:52,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:52,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:13:52,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904773797] [2024-11-08 19:13:52,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:52,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:13:52,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:52,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:13:52,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:13:52,133 INFO L87 Difference]: Start difference. First operand 1148 states and 1709 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:52,160 INFO L93 Difference]: Finished difference Result 2161 states and 3223 transitions. [2024-11-08 19:13:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:13:52,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 89 [2024-11-08 19:13:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:52,164 INFO L225 Difference]: With dead ends: 2161 [2024-11-08 19:13:52,164 INFO L226 Difference]: Without dead ends: 1148 [2024-11-08 19:13:52,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:13:52,166 INFO L432 NwaCegarLoop]: 1652 mSDtfsCounter, 1 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:52,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3301 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:13:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2024-11-08 19:13:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1147. [2024-11-08 19:13:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1146 states have (on average 1.4886561954624782) internal successors, (1706), 1146 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1706 transitions. [2024-11-08 19:13:52,184 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1706 transitions. Word has length 89 [2024-11-08 19:13:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:52,184 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1706 transitions. [2024-11-08 19:13:52,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1706 transitions. [2024-11-08 19:13:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 19:13:52,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:52,185 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] [2024-11-08 19:13:52,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 19:13:52,186 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:52,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:52,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1173607042, now seen corresponding path program 1 times [2024-11-08 19:13:52,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:52,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756394282] [2024-11-08 19:13:52,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:52,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:13:52,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:13:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:13:52,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:13:52,372 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:13:52,373 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:13:52,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 19:13:52,377 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:52,467 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:13:52,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:13:52 BoogieIcfgContainer [2024-11-08 19:13:52,471 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:13:52,471 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:13:52,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:13:52,472 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:13:52,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:41" (3/4) ... [2024-11-08 19:13:52,475 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:13:52,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:13:52,476 INFO L158 Benchmark]: Toolchain (without parser) took 16354.05ms. Allocated memory was 159.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 83.1MB in the beginning and 513.8MB in the end (delta: -430.7MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-08 19:13:52,476 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:13:52,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 821.26ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 82.9MB in the beginning and 141.9MB in the end (delta: -59.0MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2024-11-08 19:13:52,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 472.65ms. Allocated memory is still 247.5MB. Free memory was 141.9MB in the beginning and 126.3MB in the end (delta: 15.6MB). Peak memory consumption was 128.0MB. Max. memory is 16.1GB. [2024-11-08 19:13:52,477 INFO L158 Benchmark]: Boogie Preprocessor took 622.96ms. Allocated memory was 247.5MB in the beginning and 534.8MB in the end (delta: 287.3MB). Free memory was 126.3MB in the beginning and 406.9MB in the end (delta: -280.6MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2024-11-08 19:13:52,477 INFO L158 Benchmark]: RCFGBuilder took 3558.77ms. Allocated memory was 534.8MB in the beginning and 838.9MB in the end (delta: 304.1MB). Free memory was 406.9MB in the beginning and 516.5MB in the end (delta: -109.6MB). Peak memory consumption was 213.9MB. Max. memory is 16.1GB. [2024-11-08 19:13:52,477 INFO L158 Benchmark]: TraceAbstraction took 10866.64ms. Allocated memory was 838.9MB in the beginning and 1.6GB in the end (delta: 750.8MB). Free memory was 516.5MB in the beginning and 513.8MB in the end (delta: 2.7MB). Peak memory consumption was 753.5MB. Max. memory is 16.1GB. [2024-11-08 19:13:52,477 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 1.6GB. Free memory is still 513.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:13:52,482 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.18ms. Allocated memory is still 159.4MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 821.26ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 82.9MB in the beginning and 141.9MB in the end (delta: -59.0MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 472.65ms. Allocated memory is still 247.5MB. Free memory was 141.9MB in the beginning and 126.3MB in the end (delta: 15.6MB). Peak memory consumption was 128.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 622.96ms. Allocated memory was 247.5MB in the beginning and 534.8MB in the end (delta: 287.3MB). Free memory was 126.3MB in the beginning and 406.9MB in the end (delta: -280.6MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. * RCFGBuilder took 3558.77ms. Allocated memory was 534.8MB in the beginning and 838.9MB in the end (delta: 304.1MB). Free memory was 406.9MB in the beginning and 516.5MB in the end (delta: -109.6MB). Peak memory consumption was 213.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10866.64ms. Allocated memory was 838.9MB in the beginning and 1.6GB in the end (delta: 750.8MB). Free memory was 516.5MB in the beginning and 513.8MB in the end (delta: 2.7MB). Peak memory consumption was 753.5MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 1.6GB. Free memory is still 513.8MB. 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 bitwiseOr at line 376. 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_28 = 0; [L46] const SORT_21 var_32 = 2; [L47] const SORT_21 var_35 = 4; [L48] const SORT_21 var_38 = 64; [L49] const SORT_3 var_45 = 1; [L50] const SORT_3 var_49 = 0; [L51] const SORT_6 var_134 = 0; [L52] const SORT_21 var_728 = 8; [L53] const SORT_21 var_748 = 16; [L54] const SORT_21 var_763 = 32; [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_356; [L72] SORT_3 input_378; [L73] SORT_3 input_393; [L74] SORT_3 input_408; [L75] SORT_3 input_423; [L76] SORT_3 input_438; [L77] SORT_3 input_453; [L78] SORT_3 input_468; [L79] SORT_3 input_483; [L80] SORT_3 input_498; [L81] SORT_3 input_513; [L82] SORT_3 input_528; [L83] SORT_3 input_543; [L84] SORT_3 input_558; [L85] SORT_3 input_573; [L86] SORT_3 input_588; [L87] SORT_3 input_604; [L88] SORT_3 input_606; [L89] SORT_3 input_608; [L90] SORT_3 input_610; [L91] SORT_3 input_612; [L92] SORT_3 input_614; [L93] SORT_3 input_616; [L94] SORT_3 input_618; [L95] SORT_3 input_623; [L96] SORT_21 input_664; [L97] SORT_21 input_665; [L98] SORT_21 input_666; [L99] SORT_21 input_667; [L100] SORT_21 input_670; [L101] SORT_21 input_674; [L102] SORT_21 input_678; [L103] SORT_21 input_686; [L104] SORT_21 input_690; [L105] SORT_21 input_692; [L106] SORT_21 input_696; [L107] SORT_21 input_699; [L108] SORT_21 input_703; [L109] SORT_21 input_708; [L110] SORT_21 input_712; [L111] SORT_21 input_717; [L112] SORT_21 input_719; [L113] SORT_21 input_720; [L114] SORT_21 input_722; [L115] SORT_21 input_726; [L116] SORT_21 input_732; [L117] SORT_21 input_739; [L118] SORT_21 input_740; [L119] SORT_21 input_742; [L120] SORT_21 input_746; [L121] SORT_21 input_752; [L122] SORT_21 input_754; [L123] SORT_21 input_755; [L124] SORT_21 input_757; [L125] SORT_21 input_761; [L126] SORT_21 input_767; [L127] SORT_21 input_771; [L128] SORT_21 input_776; [L129] SORT_21 input_778; [L130] SORT_21 input_784; [L131] SORT_21 input_796; [L132] SORT_3 input_801; [L133] SORT_3 input_810; [L134] SORT_3 input_829; [L135] SORT_3 input_836; [L136] SORT_3 input_847; [L137] SORT_3 input_853; [L138] SORT_3 input_859; [L139] SORT_3 input_865; [L140] SORT_3 input_871; [L141] SORT_3 input_877; [L142] SORT_3 input_883; [L143] SORT_3 input_889; [L144] SORT_3 input_895; [L145] SORT_3 input_901; [L146] SORT_3 input_907; [L147] SORT_3 input_913; [L148] SORT_3 input_919; [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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L151] SORT_21 state_26 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L152] SORT_3 state_50 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L153] SORT_3 state_52 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L154] SORT_3 state_54 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L155] SORT_3 state_58 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L156] SORT_3 state_62 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L157] SORT_3 state_66 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L158] SORT_3 state_82 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L159] SORT_3 state_99 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L160] SORT_3 state_102 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L161] SORT_3 state_104 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L162] SORT_3 state_108 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L163] SORT_3 state_112 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L164] SORT_3 state_117 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L165] SORT_3 state_120 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L166] SORT_3 state_130 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L167] SORT_3 state_137 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L168] SORT_3 state_140 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L169] SORT_3 state_149 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L170] SORT_3 state_154 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L171] SORT_3 state_157 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L172] SORT_3 state_169 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L173] SORT_3 state_179 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L174] SORT_3 state_184 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L175] SORT_3 state_187 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L176] SORT_3 state_196 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L177] SORT_3 state_209 = __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_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L178] SORT_3 state_222 = __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_27_arg_1 = var_22; [L183] state_26 = init_27_arg_1 [L184] SORT_3 init_51_arg_1 = var_49; [L185] state_50 = init_51_arg_1 [L186] SORT_3 init_53_arg_1 = var_49; [L187] state_52 = init_53_arg_1 [L188] SORT_3 init_55_arg_1 = var_49; [L189] state_54 = init_55_arg_1 [L190] SORT_3 init_59_arg_1 = var_49; [L191] state_58 = init_59_arg_1 [L192] SORT_3 init_63_arg_1 = var_49; [L193] state_62 = init_63_arg_1 [L194] SORT_3 init_67_arg_1 = var_49; [L195] state_66 = init_67_arg_1 [L196] SORT_3 init_83_arg_1 = var_49; [L197] state_82 = init_83_arg_1 [L198] SORT_3 init_100_arg_1 = var_49; [L199] state_99 = init_100_arg_1 [L200] SORT_3 init_103_arg_1 = var_49; [L201] state_102 = init_103_arg_1 [L202] SORT_3 init_105_arg_1 = var_49; [L203] state_104 = init_105_arg_1 [L204] SORT_3 init_109_arg_1 = var_49; [L205] state_108 = init_109_arg_1 [L206] SORT_3 init_113_arg_1 = var_49; [L207] state_112 = init_113_arg_1 [L208] SORT_3 init_118_arg_1 = var_49; [L209] state_117 = init_118_arg_1 [L210] SORT_3 init_121_arg_1 = var_49; [L211] state_120 = init_121_arg_1 [L212] SORT_3 init_131_arg_1 = var_49; [L213] state_130 = init_131_arg_1 [L214] SORT_3 init_138_arg_1 = var_49; [L215] state_137 = init_138_arg_1 [L216] SORT_3 init_141_arg_1 = var_49; [L217] state_140 = init_141_arg_1 [L218] SORT_3 init_150_arg_1 = var_49; [L219] state_149 = init_150_arg_1 [L220] SORT_3 init_155_arg_1 = var_49; [L221] state_154 = init_155_arg_1 [L222] SORT_3 init_158_arg_1 = var_49; [L223] state_157 = init_158_arg_1 [L224] SORT_3 init_170_arg_1 = var_49; [L225] state_169 = init_170_arg_1 [L226] SORT_3 init_180_arg_1 = var_49; [L227] state_179 = init_180_arg_1 [L228] SORT_3 init_185_arg_1 = var_49; [L229] state_184 = init_185_arg_1 [L230] SORT_3 init_188_arg_1 = var_49; [L231] state_187 = init_188_arg_1 [L232] SORT_3 init_197_arg_1 = var_49; [L233] state_196 = init_197_arg_1 [L234] SORT_3 init_210_arg_1 = var_49; [L235] state_209 = init_210_arg_1 [L236] SORT_3 init_223_arg_1 = var_49; [L237] state_222 = init_223_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [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_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [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_356 = __VERIFIER_nondet_uchar() [L257] input_378 = __VERIFIER_nondet_uchar() [L258] input_393 = __VERIFIER_nondet_uchar() [L259] input_408 = __VERIFIER_nondet_uchar() [L260] input_423 = __VERIFIER_nondet_uchar() [L261] input_438 = __VERIFIER_nondet_uchar() [L262] input_453 = __VERIFIER_nondet_uchar() [L263] input_468 = __VERIFIER_nondet_uchar() [L264] input_483 = __VERIFIER_nondet_uchar() [L265] input_498 = __VERIFIER_nondet_uchar() [L266] input_513 = __VERIFIER_nondet_uchar() [L267] input_528 = __VERIFIER_nondet_uchar() [L268] input_543 = __VERIFIER_nondet_uchar() [L269] input_558 = __VERIFIER_nondet_uchar() [L270] input_573 = __VERIFIER_nondet_uchar() [L271] input_588 = __VERIFIER_nondet_uchar() [L272] input_604 = __VERIFIER_nondet_uchar() [L273] input_606 = __VERIFIER_nondet_uchar() [L274] input_608 = __VERIFIER_nondet_uchar() [L275] input_610 = __VERIFIER_nondet_uchar() [L276] input_612 = __VERIFIER_nondet_uchar() [L277] input_614 = __VERIFIER_nondet_uchar() [L278] input_616 = __VERIFIER_nondet_uchar() [L279] input_618 = __VERIFIER_nondet_uchar() [L280] input_623 = __VERIFIER_nondet_uchar() [L281] input_664 = __VERIFIER_nondet_uchar() [L282] input_665 = __VERIFIER_nondet_uchar() [L283] input_666 = __VERIFIER_nondet_uchar() [L284] input_667 = __VERIFIER_nondet_uchar() [L285] input_670 = __VERIFIER_nondet_uchar() [L286] input_674 = __VERIFIER_nondet_uchar() [L287] input_678 = __VERIFIER_nondet_uchar() [L288] input_686 = __VERIFIER_nondet_uchar() [L289] input_690 = __VERIFIER_nondet_uchar() [L290] input_692 = __VERIFIER_nondet_uchar() [L291] input_696 = __VERIFIER_nondet_uchar() [L292] input_699 = __VERIFIER_nondet_uchar() [L293] input_703 = __VERIFIER_nondet_uchar() [L294] input_708 = __VERIFIER_nondet_uchar() [L295] input_712 = __VERIFIER_nondet_uchar() [L296] input_717 = __VERIFIER_nondet_uchar() [L297] input_719 = __VERIFIER_nondet_uchar() [L298] input_720 = __VERIFIER_nondet_uchar() [L299] input_722 = __VERIFIER_nondet_uchar() [L300] input_726 = __VERIFIER_nondet_uchar() [L301] input_732 = __VERIFIER_nondet_uchar() [L302] input_739 = __VERIFIER_nondet_uchar() [L303] input_740 = __VERIFIER_nondet_uchar() [L304] input_742 = __VERIFIER_nondet_uchar() [L305] input_746 = __VERIFIER_nondet_uchar() [L306] input_752 = __VERIFIER_nondet_uchar() [L307] input_754 = __VERIFIER_nondet_uchar() [L308] input_755 = __VERIFIER_nondet_uchar() [L309] input_757 = __VERIFIER_nondet_uchar() [L310] input_761 = __VERIFIER_nondet_uchar() [L311] input_767 = __VERIFIER_nondet_uchar() [L312] input_771 = __VERIFIER_nondet_uchar() [L313] input_776 = __VERIFIER_nondet_uchar() [L314] input_778 = __VERIFIER_nondet_uchar() [L315] input_784 = __VERIFIER_nondet_uchar() [L316] input_796 = __VERIFIER_nondet_uchar() [L317] input_801 = __VERIFIER_nondet_uchar() [L318] input_810 = __VERIFIER_nondet_uchar() [L319] input_829 = __VERIFIER_nondet_uchar() [L320] input_836 = __VERIFIER_nondet_uchar() [L321] input_847 = __VERIFIER_nondet_uchar() [L322] input_853 = __VERIFIER_nondet_uchar() [L323] input_859 = __VERIFIER_nondet_uchar() [L324] input_865 = __VERIFIER_nondet_uchar() [L325] input_871 = __VERIFIER_nondet_uchar() [L326] input_877 = __VERIFIER_nondet_uchar() [L327] input_883 = __VERIFIER_nondet_uchar() [L328] input_889 = __VERIFIER_nondet_uchar() [L329] input_895 = __VERIFIER_nondet_uchar() [L330] input_901 = __VERIFIER_nondet_uchar() [L331] input_907 = __VERIFIER_nondet_uchar() [L332] input_913 = __VERIFIER_nondet_uchar() [L333] input_919 = __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_29_arg_0 = state_26; [L340] SORT_21 var_29_arg_1 = var_28; [L341] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L342] SORT_21 var_30_arg_0 = state_26; [L343] SORT_21 var_30_arg_1 = var_22; [L344] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L345] SORT_3 var_31_arg_0 = var_29; [L346] SORT_3 var_31_arg_1 = var_30; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_31_arg_0=0, var_31_arg_1=1, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L347] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L347] SORT_3 var_31 = var_31_arg_0 | var_31_arg_1; [L348] SORT_21 var_33_arg_0 = state_26; [L349] SORT_21 var_33_arg_1 = var_32; [L350] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L351] SORT_3 var_34_arg_0 = var_31; [L352] SORT_3 var_34_arg_1 = var_33; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_34_arg_0=1, var_34_arg_1=0, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L353] EXPR var_34_arg_0 | var_34_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L353] SORT_3 var_34 = var_34_arg_0 | var_34_arg_1; [L354] SORT_21 var_36_arg_0 = state_26; [L355] SORT_21 var_36_arg_1 = var_35; [L356] SORT_3 var_36 = var_36_arg_0 == var_36_arg_1; [L357] SORT_3 var_37_arg_0 = var_34; [L358] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_37_arg_0=1, var_37_arg_1=0, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L359] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L359] SORT_3 var_37 = var_37_arg_0 | var_37_arg_1; [L360] SORT_21 var_39_arg_0 = state_26; [L361] SORT_21 var_39_arg_1 = var_38; [L362] SORT_3 var_39 = var_39_arg_0 == var_39_arg_1; [L363] SORT_3 var_40_arg_0 = var_37; [L364] SORT_3 var_40_arg_1 = var_39; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_40_arg_0=1, var_40_arg_1=0, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L365] EXPR var_40_arg_0 | var_40_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L365] SORT_3 var_40 = var_40_arg_0 | var_40_arg_1; [L366] SORT_3 var_41_arg_0 = var_25; [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_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_41_arg_0=1, var_41_arg_1=1, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [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_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L368] SORT_3 var_41 = var_41_arg_0 & var_41_arg_1; [L369] SORT_21 var_42_arg_0 = state_23; [L370] SORT_21 var_42_arg_1 = var_22; [L371] SORT_3 var_42 = var_42_arg_0 == var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_42; [L373] SORT_3 var_43 = ~var_43_arg_0; [L374] SORT_3 var_44_arg_0 = var_41; [L375] SORT_3 var_44_arg_1 = var_43; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_44_arg_0=1, var_44_arg_1=-2, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L376] EXPR var_44_arg_0 | var_44_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L376] SORT_3 var_44 = var_44_arg_0 | var_44_arg_1; [L377] SORT_3 var_46_arg_0 = var_44; [L378] SORT_3 var_46 = ~var_46_arg_0; [L379] SORT_3 var_47_arg_0 = var_45; [L380] SORT_3 var_47_arg_1 = var_46; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_47_arg_0=1, var_47_arg_1=-255, var_49=0, var_728=8, var_748=16, var_763=32] [L381] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L381] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L382] EXPR var_47 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L382] var_47 = var_47 & mask_SORT_3 [L383] SORT_3 bad_48_arg_0 = var_47; [L384] CALL __VERIFIER_assert(!(bad_48_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27279 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27279 mSDsluCounter, 110461 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89162 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1674 IncrementalHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 21299 mSDtfsCounter, 1674 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1148occurred in iteration=11, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 5249 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1200 NumberOfCodeBlocks, 1200 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1098 ConstructedInterpolants, 0 QuantifiedInterpolants, 4484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 19:13:52,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.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 ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:13:55,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:13:55,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 19:13:55,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:13:55,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:13:55,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:13:55,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:13:55,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:13:55,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:13:55,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:13:55,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:13:55,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:13:55,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:13:55,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:13:55,179 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:13:55,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:13:55,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:13:55,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:13:55,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:13:55,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:13:55,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:13:55,181 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:13:55,181 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:13:55,182 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:13:55,182 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:13:55,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:13:55,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:13:55,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:13:55,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:13:55,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:13:55,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:13:55,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:55,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:13:55,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:13:55,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:13:55,189 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:13:55,189 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:13:55,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:13:55,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:13:55,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:13:55,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:13:55,192 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 -> ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e [2024-11-08 19:13:55,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:13:55,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:13:55,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:13:55,502 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:13:55,502 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:13:55,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2024-11-08 19:13:57,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:13:57,507 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:13:57,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2024-11-08 19:13:57,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2f0b45e/55bf58916383460dba42facbdd359f83/FLAG9be45d256 [2024-11-08 19:13:57,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2f0b45e/55bf58916383460dba42facbdd359f83 [2024-11-08 19:13:57,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:13:57,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:13:57,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:57,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:13:57,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:13:57,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:57" (1/1) ... [2024-11-08 19:13:57,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b15fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:57, skipping insertion in model container [2024-11-08 19:13:57,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:57" (1/1) ... [2024-11-08 19:13:57,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:13:57,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c[1268,1281] [2024-11-08 19:13:58,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:58,140 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:13:58,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c[1268,1281] [2024-11-08 19:13:58,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:58,285 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:13:58,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58 WrapperNode [2024-11-08 19:13:58,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:58,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:58,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:13:58,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:13:58,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (1/1) ... [2024-11-08 19:13:58,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (1/1) ... [2024-11-08 19:13:58,436 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2613 [2024-11-08 19:13:58,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:58,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:13:58,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:13:58,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:13:58,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (1/1) ... [2024-11-08 19:13:58,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (1/1) ... [2024-11-08 19:13:58,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (1/1) ... [2024-11-08 19:13:58,500 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:13:58,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (1/1) ... [2024-11-08 19:13:58,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (1/1) ... [2024-11-08 19:13:58,539 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (1/1) ... [2024-11-08 19:13:58,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (1/1) ... [2024-11-08 19:13:58,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (1/1) ... [2024-11-08 19:13:58,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (1/1) ... [2024-11-08 19:13:58,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:13:58,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:13:58,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:13:58,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:13:58,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (1/1) ... [2024-11-08 19:13:58,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:58,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:13:58,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:13:58,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:13:58,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:13:58,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:13:58,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:13:58,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:13:59,026 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:13:59,031 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:14:01,298 INFO L? ?]: Removed 155 outVars from TransFormulas that were not future-live. [2024-11-08 19:14:01,299 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:14:01,317 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:14:01,319 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:14:01,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:14:01 BoogieIcfgContainer [2024-11-08 19:14:01,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:14:01,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:14:01,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:14:01,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:14:01,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:13:57" (1/3) ... [2024-11-08 19:14:01,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0cf56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:14:01, skipping insertion in model container [2024-11-08 19:14:01,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:58" (2/3) ... [2024-11-08 19:14:01,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0cf56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:14:01, skipping insertion in model container [2024-11-08 19:14:01,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:14:01" (3/3) ... [2024-11-08 19:14:01,329 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2024-11-08 19:14:01,344 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:14:01,345 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:14:01,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:14:01,395 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;@24203045, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:14:01,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:14:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:14:01,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:01,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 19:14:01,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:01,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 19:14:01,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:14:01,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186289186] [2024-11-08 19:14:01,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:01,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:14:01,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:14:01,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:14:01,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:14:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:01,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 19:14:01,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:14:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:02,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:14:02,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:14:02,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186289186] [2024-11-08 19:14:02,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186289186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:02,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:02,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:14:02,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296802203] [2024-11-08 19:14:02,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:02,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:14:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:14:02,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:14:02,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:14:02,039 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:02,121 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-08 19:14:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:14:02,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-08 19:14:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:02,131 INFO L225 Difference]: With dead ends: 17 [2024-11-08 19:14:02,131 INFO L226 Difference]: Without dead ends: 9 [2024-11-08 19:14:02,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:14:02,137 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:02,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:14:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-08 19:14:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-08 19:14:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 19:14:02,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 19:14:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:02,165 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 19:14:02,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 19:14:02,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:14:02,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:02,166 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:02,173 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-08 19:14:02,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:14:02,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:02,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:02,369 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 19:14:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:14:02,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336118399] [2024-11-08 19:14:02,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:02,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:14:02,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:14:02,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:14:02,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:14:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:03,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-08 19:14:03,182 INFO L278 TraceCheckSpWp]: Computing forward predicates...