./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:59:23,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:59:24,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:59:24,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:59:24,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:59:24,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:59:24,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:59:24,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:59:24,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:59:24,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:59:24,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:59:24,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:59:24,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:59:24,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:59:24,115 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:59:24,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:59:24,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:59:24,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:59:24,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:59:24,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:59:24,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:59:24,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:59:24,120 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:59:24,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:59:24,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:59:24,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:59:24,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:59:24,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:59:24,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:59:24,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:59:24,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:59:24,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:59:24,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:59:24,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:59:24,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:59:24,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:59:24,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:59:24,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:59:24,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:59:24,125 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-clean/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-clean/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 -> c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f [2024-10-11 06:59:24,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:59:24,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:59:24,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:59:24,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:59:24,417 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:59:24,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2024-10-11 06:59:25,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:59:26,185 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:59:26,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2024-10-11 06:59:26,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/021641460/b77ddbef1dd24ed19f7cc2c06542ea2c/FLAG8afb619bf [2024-10-11 06:59:26,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/021641460/b77ddbef1dd24ed19f7cc2c06542ea2c [2024-10-11 06:59:26,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:59:26,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:59:26,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:59:26,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:59:26,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:59:26,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:59:26" (1/1) ... [2024-10-11 06:59:26,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2719e741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:26, skipping insertion in model container [2024-10-11 06:59:26,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:59:26" (1/1) ... [2024-10-11 06:59:26,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:59:26,546 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2024-10-11 06:59:26,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:59:27,004 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:59:27,013 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2024-10-11 06:59:27,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:59:27,215 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:59:27,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27 WrapperNode [2024-10-11 06:59:27,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:59:27,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:59:27,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:59:27,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:59:27,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (1/1) ... [2024-10-11 06:59:27,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (1/1) ... [2024-10-11 06:59:27,934 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4825 [2024-10-11 06:59:27,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:59:27,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:59:27,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:59:27,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:59:27,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (1/1) ... [2024-10-11 06:59:27,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (1/1) ... [2024-10-11 06:59:28,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (1/1) ... [2024-10-11 06:59:28,244 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 06:59:28,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (1/1) ... [2024-10-11 06:59:28,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (1/1) ... [2024-10-11 06:59:28,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (1/1) ... [2024-10-11 06:59:28,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (1/1) ... [2024-10-11 06:59:28,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (1/1) ... [2024-10-11 06:59:28,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (1/1) ... [2024-10-11 06:59:28,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:59:28,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:59:28,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:59:28,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:59:28,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (1/1) ... [2024-10-11 06:59:28,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:59:28,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:59:28,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:59:28,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:59:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:59:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:59:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:59:28,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:59:29,206 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:59:29,208 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:59:33,586 INFO L? ?]: Removed 3123 outVars from TransFormulas that were not future-live. [2024-10-11 06:59:33,586 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:59:33,691 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:59:33,694 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:59:33,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:59:33 BoogieIcfgContainer [2024-10-11 06:59:33,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:59:33,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:59:33,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:59:33,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:59:33,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:59:26" (1/3) ... [2024-10-11 06:59:33,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f8da81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:59:33, skipping insertion in model container [2024-10-11 06:59:33,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:27" (2/3) ... [2024-10-11 06:59:33,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f8da81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:59:33, skipping insertion in model container [2024-10-11 06:59:33,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:59:33" (3/3) ... [2024-10-11 06:59:33,703 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2024-10-11 06:59:33,722 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:59:33,722 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:59:33,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:59:33,829 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;@5fae742f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:59:33,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:59:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 1111 states, 1109 states have (on average 1.5004508566275925) internal successors, (1664), 1110 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 06:59:33,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:33,852 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-10-11 06:59:33,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:33,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:33,859 INFO L85 PathProgramCache]: Analyzing trace with hash 770519080, now seen corresponding path program 1 times [2024-10-11 06:59:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:33,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972837233] [2024-10-11 06:59:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:34,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:34,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972837233] [2024-10-11 06:59:34,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972837233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:34,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:34,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:59:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180600191] [2024-10-11 06:59:34,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:34,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:59:34,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:34,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:59:34,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:59:34,768 INFO L87 Difference]: Start difference. First operand has 1111 states, 1109 states have (on average 1.5004508566275925) internal successors, (1664), 1110 states have internal predecessors, (1664), 0 states have call successors, (0), 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.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-10-11 06:59:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:34,911 INFO L93 Difference]: Finished difference Result 2106 states and 3156 transitions. [2024-10-11 06:59:34,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:59:34,914 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-10-11 06:59:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:34,937 INFO L225 Difference]: With dead ends: 2106 [2024-10-11 06:59:34,938 INFO L226 Difference]: Without dead ends: 1112 [2024-10-11 06:59:34,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:59:34,951 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 0 mSDsluCounter, 3313 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4972 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:34,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4972 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:59:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2024-10-11 06:59:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2024-10-11 06:59:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1111 states have (on average 1.4977497749774977) internal successors, (1664), 1111 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1664 transitions. [2024-10-11 06:59:35,051 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1664 transitions. Word has length 82 [2024-10-11 06:59:35,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:35,052 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1664 transitions. [2024-10-11 06:59:35,052 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-10-11 06:59:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1664 transitions. [2024-10-11 06:59:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 06:59:35,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:35,058 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-10-11 06:59:35,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:59:35,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:35,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:35,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1882016636, now seen corresponding path program 1 times [2024-10-11 06:59:35,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:35,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092156900] [2024-10-11 06:59:35,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:35,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:35,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:35,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:35,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092156900] [2024-10-11 06:59:35,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092156900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:35,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:35,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:59:35,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899131913] [2024-10-11 06:59:35,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:35,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:59:35,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:35,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:59:35,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:59:35,389 INFO L87 Difference]: Start difference. First operand 1112 states and 1664 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-10-11 06:59:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:35,462 INFO L93 Difference]: Finished difference Result 2109 states and 3156 transitions. [2024-10-11 06:59:35,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:59:35,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-10-11 06:59:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:35,467 INFO L225 Difference]: With dead ends: 2109 [2024-10-11 06:59:35,468 INFO L226 Difference]: Without dead ends: 1114 [2024-10-11 06:59:35,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:59:35,472 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 0 mSDsluCounter, 3310 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4969 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:35,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4969 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:59:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-10-11 06:59:35,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1114. [2024-10-11 06:59:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1113 states have (on average 1.4968553459119496) internal successors, (1666), 1113 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1666 transitions. [2024-10-11 06:59:35,498 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1666 transitions. Word has length 83 [2024-10-11 06:59:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:35,500 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1666 transitions. [2024-10-11 06:59:35,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-10-11 06:59:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1666 transitions. [2024-10-11 06:59:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 06:59:35,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:35,504 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-10-11 06:59:35,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:59:35,504 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:35,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:35,505 INFO L85 PathProgramCache]: Analyzing trace with hash 689060993, now seen corresponding path program 1 times [2024-10-11 06:59:35,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:35,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063632372] [2024-10-11 06:59:35,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:36,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063632372] [2024-10-11 06:59:36,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063632372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:36,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:36,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:59:36,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914729672] [2024-10-11 06:59:36,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:36,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:59:36,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:36,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:59:36,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:36,705 INFO L87 Difference]: Start difference. First operand 1114 states and 1666 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 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-10-11 06:59:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:37,052 INFO L93 Difference]: Finished difference Result 2146 states and 3210 transitions. [2024-10-11 06:59:37,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:59:37,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 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-10-11 06:59:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:37,059 INFO L225 Difference]: With dead ends: 2146 [2024-10-11 06:59:37,060 INFO L226 Difference]: Without dead ends: 1149 [2024-10-11 06:59:37,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:59:37,063 INFO L432 NwaCegarLoop]: 1636 mSDtfsCounter, 1685 mSDsluCounter, 6537 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 8173 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:37,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 8173 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:59:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-10-11 06:59:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1148. [2024-10-11 06:59:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4960767218831734) internal successors, (1716), 1147 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1716 transitions. [2024-10-11 06:59:37,092 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1716 transitions. Word has length 84 [2024-10-11 06:59:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:37,093 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1716 transitions. [2024-10-11 06:59:37,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 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-10-11 06:59:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1716 transitions. [2024-10-11 06:59:37,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 06:59:37,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:37,095 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-10-11 06:59:37,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:59:37,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:37,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:37,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1450599911, now seen corresponding path program 1 times [2024-10-11 06:59:37,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:37,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939301430] [2024-10-11 06:59:37,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:37,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:37,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:37,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939301430] [2024-10-11 06:59:37,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939301430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:37,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:37,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:59:37,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112749194] [2024-10-11 06:59:37,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:37,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:59:37,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:37,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:59:37,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:59:37,959 INFO L87 Difference]: Start difference. First operand 1148 states and 1716 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 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-10-11 06:59:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:38,129 INFO L93 Difference]: Finished difference Result 2171 states and 3245 transitions. [2024-10-11 06:59:38,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:59:38,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 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-10-11 06:59:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:38,135 INFO L225 Difference]: With dead ends: 2171 [2024-10-11 06:59:38,135 INFO L226 Difference]: Without dead ends: 1148 [2024-10-11 06:59:38,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:59:38,140 INFO L432 NwaCegarLoop]: 1641 mSDtfsCounter, 1645 mSDsluCounter, 3283 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 4924 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:38,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 4924 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:59:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2024-10-11 06:59:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148. [2024-10-11 06:59:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4952048823016566) internal successors, (1715), 1147 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1715 transitions. [2024-10-11 06:59:38,167 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1715 transitions. Word has length 85 [2024-10-11 06:59:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:38,168 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1715 transitions. [2024-10-11 06:59:38,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 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-10-11 06:59:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1715 transitions. [2024-10-11 06:59:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 06:59:38,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:38,170 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-10-11 06:59:38,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:59:38,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:38,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:38,171 INFO L85 PathProgramCache]: Analyzing trace with hash 751167955, now seen corresponding path program 1 times [2024-10-11 06:59:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:38,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259983268] [2024-10-11 06:59:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:38,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:38,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259983268] [2024-10-11 06:59:38,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259983268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:38,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:38,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:59:38,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330594149] [2024-10-11 06:59:38,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:38,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:59:38,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:38,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:59:38,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:59:38,904 INFO L87 Difference]: Start difference. First operand 1148 states and 1715 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 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-10-11 06:59:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:39,127 INFO L93 Difference]: Finished difference Result 2171 states and 3244 transitions. [2024-10-11 06:59:39,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:59:39,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 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-10-11 06:59:39,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:39,132 INFO L225 Difference]: With dead ends: 2171 [2024-10-11 06:59:39,133 INFO L226 Difference]: Without dead ends: 1151 [2024-10-11 06:59:39,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:59:39,135 INFO L432 NwaCegarLoop]: 1640 mSDtfsCounter, 1690 mSDsluCounter, 3368 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 5008 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:39,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 5008 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:59:39,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-10-11 06:59:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1151. [2024-10-11 06:59:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1150 states have (on average 1.4939130434782608) internal successors, (1718), 1150 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1718 transitions. [2024-10-11 06:59:39,155 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1718 transitions. Word has length 86 [2024-10-11 06:59:39,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:39,156 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1718 transitions. [2024-10-11 06:59:39,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 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-10-11 06:59:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1718 transitions. [2024-10-11 06:59:39,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 06:59:39,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:39,157 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-10-11 06:59:39,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:59:39,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:39,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:39,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2062890126, now seen corresponding path program 1 times [2024-10-11 06:59:39,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:39,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285716337] [2024-10-11 06:59:39,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:39,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:39,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:39,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285716337] [2024-10-11 06:59:39,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285716337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:39,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:39,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:59:39,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369726033] [2024-10-11 06:59:39,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:39,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:59:39,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:39,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:59:39,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:59:39,845 INFO L87 Difference]: Start difference. First operand 1151 states and 1718 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 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-10-11 06:59:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:40,169 INFO L93 Difference]: Finished difference Result 2170 states and 3241 transitions. [2024-10-11 06:59:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:59:40,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 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-10-11 06:59:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:40,174 INFO L225 Difference]: With dead ends: 2170 [2024-10-11 06:59:40,174 INFO L226 Difference]: Without dead ends: 1155 [2024-10-11 06:59:40,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-11 06:59:40,177 INFO L432 NwaCegarLoop]: 1635 mSDtfsCounter, 1697 mSDsluCounter, 6590 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 8225 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:40,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 8225 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:59:40,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-10-11 06:59:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1153. [2024-10-11 06:59:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.4930555555555556) internal successors, (1720), 1152 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1720 transitions. [2024-10-11 06:59:40,200 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1720 transitions. Word has length 87 [2024-10-11 06:59:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:40,200 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1720 transitions. [2024-10-11 06:59:40,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 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-10-11 06:59:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1720 transitions. [2024-10-11 06:59:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 06:59:40,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:40,204 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-10-11 06:59:40,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:59:40,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:40,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:40,205 INFO L85 PathProgramCache]: Analyzing trace with hash -17060054, now seen corresponding path program 1 times [2024-10-11 06:59:40,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:40,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944741904] [2024-10-11 06:59:40,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:40,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:40,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:40,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944741904] [2024-10-11 06:59:40,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944741904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:40,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:40,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:59:40,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210993327] [2024-10-11 06:59:40,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:40,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:59:40,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:40,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:59:40,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:59:40,642 INFO L87 Difference]: Start difference. First operand 1153 states and 1720 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 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-10-11 06:59:40,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:40,792 INFO L93 Difference]: Finished difference Result 2170 states and 3240 transitions. [2024-10-11 06:59:40,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:59:40,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 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-10-11 06:59:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:40,796 INFO L225 Difference]: With dead ends: 2170 [2024-10-11 06:59:40,797 INFO L226 Difference]: Without dead ends: 1146 [2024-10-11 06:59:40,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:40,800 INFO L432 NwaCegarLoop]: 1643 mSDtfsCounter, 1673 mSDsluCounter, 3283 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 4926 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:40,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 4926 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:59:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2024-10-11 06:59:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1146. [2024-10-11 06:59:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 1.4925764192139739) internal successors, (1709), 1145 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-10-11 06:59:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1709 transitions. [2024-10-11 06:59:40,824 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1709 transitions. Word has length 87 [2024-10-11 06:59:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:40,824 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1709 transitions. [2024-10-11 06:59:40,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 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-10-11 06:59:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1709 transitions. [2024-10-11 06:59:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 06:59:40,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:40,825 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-10-11 06:59:40,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:59:40,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:40,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:40,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1357008870, now seen corresponding path program 1 times [2024-10-11 06:59:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:40,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545229763] [2024-10-11 06:59:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:40,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:41,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:41,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545229763] [2024-10-11 06:59:41,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545229763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:41,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:41,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 06:59:41,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663304857] [2024-10-11 06:59:41,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:41,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 06:59:41,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:41,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 06:59:41,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:59:41,748 INFO L87 Difference]: Start difference. First operand 1146 states and 1709 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 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-10-11 06:59:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:42,258 INFO L93 Difference]: Finished difference Result 2161 states and 3226 transitions. [2024-10-11 06:59:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 06:59:42,259 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 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-10-11 06:59:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:42,263 INFO L225 Difference]: With dead ends: 2161 [2024-10-11 06:59:42,264 INFO L226 Difference]: Without dead ends: 1153 [2024-10-11 06:59:42,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2024-10-11 06:59:42,267 INFO L432 NwaCegarLoop]: 1631 mSDtfsCounter, 1684 mSDsluCounter, 8234 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 9865 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:42,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 9865 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:59:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-10-11 06:59:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1152. [2024-10-11 06:59:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.4917463075586446) internal successors, (1717), 1151 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1717 transitions. [2024-10-11 06:59:42,289 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1717 transitions. Word has length 88 [2024-10-11 06:59:42,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:42,289 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1717 transitions. [2024-10-11 06:59:42,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 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-10-11 06:59:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1717 transitions. [2024-10-11 06:59:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 06:59:42,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:42,290 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-10-11 06:59:42,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 06:59:42,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:42,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1761856337, now seen corresponding path program 1 times [2024-10-11 06:59:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:42,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106144623] [2024-10-11 06:59:42,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:42,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:42,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:42,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106144623] [2024-10-11 06:59:42,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106144623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:42,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:42,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:59:42,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202643766] [2024-10-11 06:59:42,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:42,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:59:42,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:59:42,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:59:42,667 INFO L87 Difference]: Start difference. First operand 1152 states and 1717 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-10-11 06:59:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:42,820 INFO L93 Difference]: Finished difference Result 2164 states and 3229 transitions. [2024-10-11 06:59:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:59:42,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-10-11 06:59:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:42,827 INFO L225 Difference]: With dead ends: 2164 [2024-10-11 06:59:42,827 INFO L226 Difference]: Without dead ends: 1148 [2024-10-11 06:59:42,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:42,831 INFO L432 NwaCegarLoop]: 1642 mSDtfsCounter, 1663 mSDsluCounter, 3281 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1663 SdHoareTripleChecker+Valid, 4923 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:42,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1663 Valid, 4923 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:59:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2024-10-11 06:59:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148. [2024-10-11 06:59:42,851 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-10-11 06:59:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1710 transitions. [2024-10-11 06:59:42,854 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1710 transitions. Word has length 89 [2024-10-11 06:59:42,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:42,854 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1710 transitions. [2024-10-11 06:59:42,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-10-11 06:59:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1710 transitions. [2024-10-11 06:59:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 06:59:42,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:42,856 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-10-11 06:59:42,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 06:59:42,856 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:42,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash -762340068, now seen corresponding path program 1 times [2024-10-11 06:59:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:42,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599378293] [2024-10-11 06:59:42,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:42,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:43,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:43,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599378293] [2024-10-11 06:59:43,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599378293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:43,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:43,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:59:43,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229001713] [2024-10-11 06:59:43,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:43,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:59:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:43,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:59:43,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:43,335 INFO L87 Difference]: Start difference. First operand 1148 states and 1710 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 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-10-11 06:59:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:43,544 INFO L93 Difference]: Finished difference Result 2155 states and 3215 transitions. [2024-10-11 06:59:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:59:43,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 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-10-11 06:59:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:43,551 INFO L225 Difference]: With dead ends: 2155 [2024-10-11 06:59:43,551 INFO L226 Difference]: Without dead ends: 1152 [2024-10-11 06:59:43,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:59:43,553 INFO L432 NwaCegarLoop]: 1637 mSDtfsCounter, 1668 mSDsluCounter, 3315 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:43,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 4952 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:59:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-10-11 06:59:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1150. [2024-10-11 06:59:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.4899912967798086) internal successors, (1712), 1149 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1712 transitions. [2024-10-11 06:59:43,577 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1712 transitions. Word has length 89 [2024-10-11 06:59:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:43,578 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1712 transitions. [2024-10-11 06:59:43,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 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-10-11 06:59:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1712 transitions. [2024-10-11 06:59:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 06:59:43,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:43,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:43,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 06:59:43,579 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:43,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash 761575553, now seen corresponding path program 1 times [2024-10-11 06:59:43,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:43,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099696601] [2024-10-11 06:59:43,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:43,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:44,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:44,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099696601] [2024-10-11 06:59:44,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099696601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:44,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:44,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:59:44,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180500246] [2024-10-11 06:59:44,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:44,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:59:44,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:44,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:59:44,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:44,218 INFO L87 Difference]: Start difference. First operand 1150 states and 1712 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:44,434 INFO L93 Difference]: Finished difference Result 2153 states and 3211 transitions. [2024-10-11 06:59:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:59:44,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-11 06:59:44,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:44,439 INFO L225 Difference]: With dead ends: 2153 [2024-10-11 06:59:44,439 INFO L226 Difference]: Without dead ends: 1153 [2024-10-11 06:59:44,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:59:44,441 INFO L432 NwaCegarLoop]: 1641 mSDtfsCounter, 1657 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1657 SdHoareTripleChecker+Valid, 4966 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:44,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1657 Valid, 4966 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:59:44,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-10-11 06:59:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1152. [2024-10-11 06:59:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.4891398783666376) internal successors, (1714), 1151 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1714 transitions. [2024-10-11 06:59:44,465 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1714 transitions. Word has length 90 [2024-10-11 06:59:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:44,465 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1714 transitions. [2024-10-11 06:59:44,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1714 transitions. [2024-10-11 06:59:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 06:59:44,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:44,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:44,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 06:59:44,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:44,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash 105917253, now seen corresponding path program 1 times [2024-10-11 06:59:44,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:44,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765196538] [2024-10-11 06:59:44,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:44,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:44,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:44,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765196538] [2024-10-11 06:59:44,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765196538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:44,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:44,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:59:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346385037] [2024-10-11 06:59:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:44,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:59:44,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:59:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:45,000 INFO L87 Difference]: Start difference. First operand 1152 states and 1714 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:45,237 INFO L93 Difference]: Finished difference Result 2164 states and 3223 transitions. [2024-10-11 06:59:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:59:45,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-11 06:59:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:45,242 INFO L225 Difference]: With dead ends: 2164 [2024-10-11 06:59:45,242 INFO L226 Difference]: Without dead ends: 1145 [2024-10-11 06:59:45,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-10-11 06:59:45,245 INFO L432 NwaCegarLoop]: 1641 mSDtfsCounter, 1651 mSDsluCounter, 6557 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 8198 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:45,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 8198 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:59:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-10-11 06:59:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1145. [2024-10-11 06:59:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1144 states have (on average 1.4877622377622377) internal successors, (1702), 1144 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1702 transitions. [2024-10-11 06:59:45,270 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1702 transitions. Word has length 90 [2024-10-11 06:59:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:45,271 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1702 transitions. [2024-10-11 06:59:45,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1702 transitions. [2024-10-11 06:59:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 06:59:45,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:45,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:45,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 06:59:45,272 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:45,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1975509792, now seen corresponding path program 1 times [2024-10-11 06:59:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:45,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910603384] [2024-10-11 06:59:45,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:45,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:46,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:46,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910603384] [2024-10-11 06:59:46,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910603384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:46,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:46,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 06:59:46,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328106913] [2024-10-11 06:59:46,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:46,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 06:59:46,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:46,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 06:59:46,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2024-10-11 06:59:46,278 INFO L87 Difference]: Start difference. First operand 1145 states and 1702 transitions. Second operand has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:47,173 INFO L93 Difference]: Finished difference Result 2171 states and 3236 transitions. [2024-10-11 06:59:47,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 06:59:47,173 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 06:59:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:47,178 INFO L225 Difference]: With dead ends: 2171 [2024-10-11 06:59:47,178 INFO L226 Difference]: Without dead ends: 1174 [2024-10-11 06:59:47,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 06:59:47,181 INFO L432 NwaCegarLoop]: 1637 mSDtfsCounter, 1636 mSDsluCounter, 24517 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 26154 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:47,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1636 Valid, 26154 Invalid, 685 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 06:59:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2024-10-11 06:59:47,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1164. [2024-10-11 06:59:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 1.4901117798796217) internal successors, (1733), 1163 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1733 transitions. [2024-10-11 06:59:47,203 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1733 transitions. Word has length 91 [2024-10-11 06:59:47,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:47,204 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1733 transitions. [2024-10-11 06:59:47,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1733 transitions. [2024-10-11 06:59:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 06:59:47,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:47,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:47,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 06:59:47,206 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:47,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:47,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1619160280, now seen corresponding path program 1 times [2024-10-11 06:59:47,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:47,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638699958] [2024-10-11 06:59:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:47,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:59:47,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:59:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:59:47,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:59:47,451 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:59:47,452 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:59:47,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 06:59:47,456 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:47,556 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:59:47,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:59:47 BoogieIcfgContainer [2024-10-11 06:59:47,560 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:59:47,561 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:59:47,561 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:59:47,561 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:59:47,561 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:59:33" (3/4) ... [2024-10-11 06:59:47,563 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:59:47,564 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:59:47,564 INFO L158 Benchmark]: Toolchain (without parser) took 21332.83ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 96.2MB in the beginning and 841.1MB in the end (delta: -744.9MB). Peak memory consumption was 493.3MB. Max. memory is 16.1GB. [2024-10-11 06:59:47,565 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 146.8MB. Free memory was 107.6MB in the beginning and 107.4MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:59:47,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 981.40ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 96.2MB in the beginning and 109.9MB in the end (delta: -13.7MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2024-10-11 06:59:47,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 718.64ms. Allocated memory is still 199.2MB. Free memory was 109.9MB in the beginning and 88.6MB in the end (delta: 21.3MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. [2024-10-11 06:59:47,566 INFO L158 Benchmark]: Boogie Preprocessor took 724.39ms. Allocated memory was 199.2MB in the beginning and 398.5MB in the end (delta: 199.2MB). Free memory was 88.6MB in the beginning and 230.7MB in the end (delta: -142.1MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2024-10-11 06:59:47,566 INFO L158 Benchmark]: RCFGBuilder took 5031.91ms. Allocated memory was 398.5MB in the beginning and 671.1MB in the end (delta: 272.6MB). Free memory was 230.7MB in the beginning and 412.3MB in the end (delta: -181.7MB). Peak memory consumption was 270.5MB. Max. memory is 16.1GB. [2024-10-11 06:59:47,567 INFO L158 Benchmark]: TraceAbstraction took 13861.89ms. Allocated memory was 671.1MB in the beginning and 1.4GB in the end (delta: 713.0MB). Free memory was 411.3MB in the beginning and 841.1MB in the end (delta: -429.8MB). Peak memory consumption was 282.2MB. Max. memory is 16.1GB. [2024-10-11 06:59:47,567 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 1.4GB. Free memory is still 841.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:59:47,571 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.21ms. Allocated memory is still 146.8MB. Free memory was 107.6MB in the beginning and 107.4MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 981.40ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 96.2MB in the beginning and 109.9MB in the end (delta: -13.7MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 718.64ms. Allocated memory is still 199.2MB. Free memory was 109.9MB in the beginning and 88.6MB in the end (delta: 21.3MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 724.39ms. Allocated memory was 199.2MB in the beginning and 398.5MB in the end (delta: 199.2MB). Free memory was 88.6MB in the beginning and 230.7MB in the end (delta: -142.1MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * RCFGBuilder took 5031.91ms. Allocated memory was 398.5MB in the beginning and 671.1MB in the end (delta: 272.6MB). Free memory was 230.7MB in the beginning and 412.3MB in the end (delta: -181.7MB). Peak memory consumption was 270.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13861.89ms. Allocated memory was 671.1MB in the beginning and 1.4GB in the end (delta: 713.0MB). Free memory was 411.3MB in the beginning and 841.1MB in the end (delta: -429.8MB). Peak memory consumption was 282.2MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 1.4GB. Free memory is still 841.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 385. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_26 = 2; [L46] const SORT_21 var_29 = 4; [L47] const SORT_21 var_32 = 8; [L48] const SORT_21 var_35 = 16; [L49] const SORT_21 var_38 = 32; [L50] const SORT_21 var_41 = 64; [L51] const SORT_21 var_44 = 0; [L52] const SORT_3 var_47 = 1; [L53] const SORT_3 var_51 = 0; [L54] const SORT_6 var_138 = 0; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_360; [L72] SORT_3 input_382; [L73] SORT_3 input_397; [L74] SORT_3 input_412; [L75] SORT_3 input_427; [L76] SORT_3 input_442; [L77] SORT_3 input_457; [L78] SORT_3 input_472; [L79] SORT_3 input_487; [L80] SORT_3 input_502; [L81] SORT_3 input_517; [L82] SORT_3 input_532; [L83] SORT_3 input_547; [L84] SORT_3 input_562; [L85] SORT_3 input_577; [L86] SORT_3 input_592; [L87] SORT_3 input_608; [L88] SORT_3 input_610; [L89] SORT_3 input_612; [L90] SORT_3 input_614; [L91] SORT_3 input_616; [L92] SORT_3 input_618; [L93] SORT_3 input_620; [L94] SORT_3 input_622; [L95] SORT_3 input_627; [L96] SORT_3 input_669; [L97] SORT_3 input_678; [L98] SORT_21 input_683; [L99] SORT_21 input_684; [L100] SORT_21 input_685; [L101] SORT_21 input_686; [L102] SORT_21 input_689; [L103] SORT_21 input_693; [L104] SORT_21 input_697; [L105] SORT_21 input_705; [L106] SORT_21 input_709; [L107] SORT_21 input_711; [L108] SORT_21 input_715; [L109] SORT_21 input_718; [L110] SORT_21 input_722; [L111] SORT_21 input_727; [L112] SORT_21 input_731; [L113] SORT_21 input_736; [L114] SORT_21 input_738; [L115] SORT_21 input_739; [L116] SORT_21 input_741; [L117] SORT_21 input_745; [L118] SORT_21 input_750; [L119] SORT_21 input_757; [L120] SORT_21 input_758; [L121] SORT_21 input_760; [L122] SORT_21 input_764; [L123] SORT_21 input_769; [L124] SORT_21 input_771; [L125] SORT_21 input_772; [L126] SORT_21 input_774; [L127] SORT_21 input_778; [L128] SORT_21 input_783; [L129] SORT_21 input_787; [L130] SORT_21 input_792; [L131] SORT_21 input_794; [L132] SORT_21 input_800; [L133] SORT_21 input_812; [L134] SORT_3 input_830; [L135] SORT_3 input_837; [L136] SORT_3 input_848; [L137] SORT_3 input_854; [L138] SORT_3 input_860; [L139] SORT_3 input_866; [L140] SORT_3 input_872; [L141] SORT_3 input_878; [L142] SORT_3 input_884; [L143] SORT_3 input_890; [L144] SORT_3 input_896; [L145] SORT_3 input_902; [L146] SORT_3 input_908; [L147] SORT_3 input_914; [L148] SORT_3 input_920; [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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] 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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L151] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L152] SORT_3 state_54 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L153] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] 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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L154] SORT_21 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_21; [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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L155] SORT_3 state_62 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L156] SORT_3 state_66 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L157] SORT_3 state_70 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L158] SORT_3 state_86 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L159] SORT_3 state_103 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L160] SORT_3 state_106 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L161] SORT_3 state_108 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L162] SORT_3 state_112 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L163] SORT_3 state_116 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L164] SORT_3 state_121 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L165] SORT_3 state_124 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L166] SORT_3 state_134 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L167] SORT_3 state_141 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L168] SORT_3 state_144 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L169] SORT_3 state_153 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L170] SORT_3 state_158 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L171] SORT_3 state_161 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L172] SORT_3 state_173 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L173] SORT_3 state_183 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L174] SORT_3 state_188 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L175] SORT_3 state_191 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L176] SORT_3 state_200 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L177] SORT_3 state_213 = __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_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L178] SORT_3 state_226 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_3 init_53_arg_1 = var_51; [L183] state_52 = init_53_arg_1 [L184] SORT_3 init_55_arg_1 = var_51; [L185] state_54 = init_55_arg_1 [L186] SORT_3 init_57_arg_1 = var_51; [L187] state_56 = init_57_arg_1 [L188] SORT_21 init_59_arg_1 = var_22; [L189] state_58 = init_59_arg_1 [L190] SORT_3 init_63_arg_1 = var_51; [L191] state_62 = init_63_arg_1 [L192] SORT_3 init_67_arg_1 = var_51; [L193] state_66 = init_67_arg_1 [L194] SORT_3 init_71_arg_1 = var_51; [L195] state_70 = init_71_arg_1 [L196] SORT_3 init_87_arg_1 = var_51; [L197] state_86 = init_87_arg_1 [L198] SORT_3 init_104_arg_1 = var_51; [L199] state_103 = init_104_arg_1 [L200] SORT_3 init_107_arg_1 = var_51; [L201] state_106 = init_107_arg_1 [L202] SORT_3 init_109_arg_1 = var_51; [L203] state_108 = init_109_arg_1 [L204] SORT_3 init_113_arg_1 = var_51; [L205] state_112 = init_113_arg_1 [L206] SORT_3 init_117_arg_1 = var_51; [L207] state_116 = init_117_arg_1 [L208] SORT_3 init_122_arg_1 = var_51; [L209] state_121 = init_122_arg_1 [L210] SORT_3 init_125_arg_1 = var_51; [L211] state_124 = init_125_arg_1 [L212] SORT_3 init_135_arg_1 = var_51; [L213] state_134 = init_135_arg_1 [L214] SORT_3 init_142_arg_1 = var_51; [L215] state_141 = init_142_arg_1 [L216] SORT_3 init_145_arg_1 = var_51; [L217] state_144 = init_145_arg_1 [L218] SORT_3 init_154_arg_1 = var_51; [L219] state_153 = init_154_arg_1 [L220] SORT_3 init_159_arg_1 = var_51; [L221] state_158 = init_159_arg_1 [L222] SORT_3 init_162_arg_1 = var_51; [L223] state_161 = init_162_arg_1 [L224] SORT_3 init_174_arg_1 = var_51; [L225] state_173 = init_174_arg_1 [L226] SORT_3 init_184_arg_1 = var_51; [L227] state_183 = init_184_arg_1 [L228] SORT_3 init_189_arg_1 = var_51; [L229] state_188 = init_189_arg_1 [L230] SORT_3 init_192_arg_1 = var_51; [L231] state_191 = init_192_arg_1 [L232] SORT_3 init_201_arg_1 = var_51; [L233] state_200 = init_201_arg_1 [L234] SORT_3 init_214_arg_1 = var_51; [L235] state_213 = init_214_arg_1 [L236] SORT_3 init_227_arg_1 = var_51; [L237] state_226 = init_227_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_360 = __VERIFIER_nondet_uchar() [L257] input_382 = __VERIFIER_nondet_uchar() [L258] input_397 = __VERIFIER_nondet_uchar() [L259] input_412 = __VERIFIER_nondet_uchar() [L260] input_427 = __VERIFIER_nondet_uchar() [L261] input_442 = __VERIFIER_nondet_uchar() [L262] input_457 = __VERIFIER_nondet_uchar() [L263] input_472 = __VERIFIER_nondet_uchar() [L264] input_487 = __VERIFIER_nondet_uchar() [L265] input_502 = __VERIFIER_nondet_uchar() [L266] input_517 = __VERIFIER_nondet_uchar() [L267] input_532 = __VERIFIER_nondet_uchar() [L268] input_547 = __VERIFIER_nondet_uchar() [L269] input_562 = __VERIFIER_nondet_uchar() [L270] input_577 = __VERIFIER_nondet_uchar() [L271] input_592 = __VERIFIER_nondet_uchar() [L272] input_608 = __VERIFIER_nondet_uchar() [L273] input_610 = __VERIFIER_nondet_uchar() [L274] input_612 = __VERIFIER_nondet_uchar() [L275] input_614 = __VERIFIER_nondet_uchar() [L276] input_616 = __VERIFIER_nondet_uchar() [L277] input_618 = __VERIFIER_nondet_uchar() [L278] input_620 = __VERIFIER_nondet_uchar() [L279] input_622 = __VERIFIER_nondet_uchar() [L280] input_627 = __VERIFIER_nondet_uchar() [L281] input_669 = __VERIFIER_nondet_uchar() [L282] input_678 = __VERIFIER_nondet_uchar() [L283] input_683 = __VERIFIER_nondet_uchar() [L284] input_684 = __VERIFIER_nondet_uchar() [L285] input_685 = __VERIFIER_nondet_uchar() [L286] input_686 = __VERIFIER_nondet_uchar() [L287] input_689 = __VERIFIER_nondet_uchar() [L288] input_693 = __VERIFIER_nondet_uchar() [L289] input_697 = __VERIFIER_nondet_uchar() [L290] input_705 = __VERIFIER_nondet_uchar() [L291] input_709 = __VERIFIER_nondet_uchar() [L292] input_711 = __VERIFIER_nondet_uchar() [L293] input_715 = __VERIFIER_nondet_uchar() [L294] input_718 = __VERIFIER_nondet_uchar() [L295] input_722 = __VERIFIER_nondet_uchar() [L296] input_727 = __VERIFIER_nondet_uchar() [L297] input_731 = __VERIFIER_nondet_uchar() [L298] input_736 = __VERIFIER_nondet_uchar() [L299] input_738 = __VERIFIER_nondet_uchar() [L300] input_739 = __VERIFIER_nondet_uchar() [L301] input_741 = __VERIFIER_nondet_uchar() [L302] input_745 = __VERIFIER_nondet_uchar() [L303] input_750 = __VERIFIER_nondet_uchar() [L304] input_757 = __VERIFIER_nondet_uchar() [L305] input_758 = __VERIFIER_nondet_uchar() [L306] input_760 = __VERIFIER_nondet_uchar() [L307] input_764 = __VERIFIER_nondet_uchar() [L308] input_769 = __VERIFIER_nondet_uchar() [L309] input_771 = __VERIFIER_nondet_uchar() [L310] input_772 = __VERIFIER_nondet_uchar() [L311] input_774 = __VERIFIER_nondet_uchar() [L312] input_778 = __VERIFIER_nondet_uchar() [L313] input_783 = __VERIFIER_nondet_uchar() [L314] input_787 = __VERIFIER_nondet_uchar() [L315] input_792 = __VERIFIER_nondet_uchar() [L316] input_794 = __VERIFIER_nondet_uchar() [L317] input_800 = __VERIFIER_nondet_uchar() [L318] input_812 = __VERIFIER_nondet_uchar() [L319] input_830 = __VERIFIER_nondet_uchar() [L320] input_837 = __VERIFIER_nondet_uchar() [L321] input_848 = __VERIFIER_nondet_uchar() [L322] input_854 = __VERIFIER_nondet_uchar() [L323] input_860 = __VERIFIER_nondet_uchar() [L324] input_866 = __VERIFIER_nondet_uchar() [L325] input_872 = __VERIFIER_nondet_uchar() [L326] input_878 = __VERIFIER_nondet_uchar() [L327] input_884 = __VERIFIER_nondet_uchar() [L328] input_890 = __VERIFIER_nondet_uchar() [L329] input_896 = __VERIFIER_nondet_uchar() [L330] input_902 = __VERIFIER_nondet_uchar() [L331] input_908 = __VERIFIER_nondet_uchar() [L332] input_914 = __VERIFIER_nondet_uchar() [L333] input_920 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_27_arg_0 = state_23; [L340] SORT_21 var_27_arg_1 = var_26; [L341] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L342] SORT_3 var_28_arg_0 = var_25; [L343] SORT_3 var_28_arg_1 = var_27; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_28_arg_0=1, var_28_arg_1=0, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L344] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L344] SORT_3 var_28 = var_28_arg_0 | var_28_arg_1; [L345] SORT_21 var_30_arg_0 = state_23; [L346] SORT_21 var_30_arg_1 = var_29; [L347] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L348] SORT_3 var_31_arg_0 = var_28; [L349] 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_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_31_arg_0=1, var_31_arg_1=0, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L350] 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_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L350] SORT_3 var_31 = var_31_arg_0 | var_31_arg_1; [L351] SORT_21 var_33_arg_0 = state_23; [L352] SORT_21 var_33_arg_1 = var_32; [L353] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L354] SORT_3 var_34_arg_0 = var_31; [L355] 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_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_34_arg_0=1, var_34_arg_1=0, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L356] 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_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L356] SORT_3 var_34 = var_34_arg_0 | var_34_arg_1; [L357] SORT_21 var_36_arg_0 = state_23; [L358] SORT_21 var_36_arg_1 = var_35; [L359] SORT_3 var_36 = var_36_arg_0 == var_36_arg_1; [L360] SORT_3 var_37_arg_0 = var_34; [L361] 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_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_37_arg_0=1, var_37_arg_1=0, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L362] 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_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L362] SORT_3 var_37 = var_37_arg_0 | var_37_arg_1; [L363] SORT_21 var_39_arg_0 = state_23; [L364] SORT_21 var_39_arg_1 = var_38; [L365] SORT_3 var_39 = var_39_arg_0 == var_39_arg_1; [L366] SORT_3 var_40_arg_0 = var_37; [L367] 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_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_40_arg_0=1, var_40_arg_1=0, var_41=64, var_44=0, var_47=1, var_51=0] [L368] 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_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L368] SORT_3 var_40 = var_40_arg_0 | var_40_arg_1; [L369] SORT_21 var_42_arg_0 = state_23; [L370] SORT_21 var_42_arg_1 = var_41; [L371] SORT_3 var_42 = var_42_arg_0 == var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_40; [L373] SORT_3 var_43_arg_1 = var_42; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_43_arg_0=1, var_43_arg_1=0, var_44=0, var_47=1, var_51=0] [L374] EXPR var_43_arg_0 | var_43_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L374] SORT_3 var_43 = var_43_arg_0 | var_43_arg_1; [L375] SORT_21 var_45_arg_0 = state_23; [L376] SORT_21 var_45_arg_1 = var_44; [L377] SORT_3 var_45 = var_45_arg_0 == var_45_arg_1; [L378] SORT_3 var_46_arg_0 = var_43; [L379] SORT_3 var_46_arg_1 = var_45; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46_arg_0=1, var_46_arg_1=0, var_47=1, var_51=0] [L380] EXPR var_46_arg_0 | var_46_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L380] SORT_3 var_46 = var_46_arg_0 | var_46_arg_1; [L381] SORT_3 var_48_arg_0 = var_46; [L382] SORT_3 var_48 = ~var_48_arg_0; [L383] SORT_3 var_49_arg_0 = var_47; [L384] SORT_3 var_49_arg_1 = var_48; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_49_arg_0=1, var_49_arg_1=-2, var_51=0] [L385] EXPR var_49_arg_0 & var_49_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L385] SORT_3 var_49 = var_49_arg_0 & var_49_arg_1; [L386] EXPR var_49 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L386] var_49 = var_49 & mask_SORT_3 [L387] SORT_3 bad_50_arg_0 = var_49; [L388] CALL __VERIFIER_assert(!(bad_50_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18349 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18349 mSDsluCounter, 100255 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78913 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1869 IncrementalHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 21342 mSDtfsCounter, 1869 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=13, InterpolantAutomatonStates: 98, 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, 17 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1223 NumberOfCodeBlocks, 1223 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1118 ConstructedInterpolants, 0 QuantifiedInterpolants, 6440 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-10-11 06:59:47,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:59:50,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:59:50,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 06:59:50,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:59:50,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:59:50,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:59:50,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:59:50,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:59:50,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:59:50,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:59:50,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:59:50,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:59:50,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:59:50,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:59:50,142 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:59:50,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:59:50,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:59:50,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:59:50,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:59:50,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:59:50,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:59:50,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:59:50,148 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:59:50,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:59:50,148 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:59:50,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:59:50,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:59:50,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:59:50,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:59:50,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:59:50,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:59:50,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:59:50,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:59:50,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:59:50,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:59:50,150 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:59:50,151 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:59:50,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:59:50,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:59:50,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:59:50,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:59:50,153 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:59:50,153 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-clean/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-clean/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 -> c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f [2024-10-11 06:59:50,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:59:50,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:59:50,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:59:50,488 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:59:50,489 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:59:50,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2024-10-11 06:59:51,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:59:52,323 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:59:52,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2024-10-11 06:59:52,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/234e5dc32/4092c007952a4756a83c17e54c5bab00/FLAG184c12858 [2024-10-11 06:59:52,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/234e5dc32/4092c007952a4756a83c17e54c5bab00 [2024-10-11 06:59:52,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:59:52,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:59:52,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:59:52,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:59:52,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:59:52,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:59:52" (1/1) ... [2024-10-11 06:59:52,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357a3b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:52, skipping insertion in model container [2024-10-11 06:59:52,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:59:52" (1/1) ... [2024-10-11 06:59:52,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:59:52,872 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2024-10-11 06:59:53,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:59:53,260 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:59:53,272 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2024-10-11 06:59:53,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:59:53,472 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:59:53,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53 WrapperNode [2024-10-11 06:59:53,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:59:53,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:59:53,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:59:53,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:59:53,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (1/1) ... [2024-10-11 06:59:53,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (1/1) ... [2024-10-11 06:59:53,684 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2617 [2024-10-11 06:59:53,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:59:53,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:59:53,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:59:53,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:59:53,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (1/1) ... [2024-10-11 06:59:53,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (1/1) ... [2024-10-11 06:59:53,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (1/1) ... [2024-10-11 06:59:53,758 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 06:59:53,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (1/1) ... [2024-10-11 06:59:53,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (1/1) ... [2024-10-11 06:59:53,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (1/1) ... [2024-10-11 06:59:53,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (1/1) ... [2024-10-11 06:59:53,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (1/1) ... [2024-10-11 06:59:53,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (1/1) ... [2024-10-11 06:59:53,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:59:53,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:59:53,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:59:53,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:59:53,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (1/1) ... [2024-10-11 06:59:53,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:59:53,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:59:53,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:59:53,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:59:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:59:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:59:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:59:53,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:59:54,428 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:59:54,433 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:59:57,417 INFO L? ?]: Removed 159 outVars from TransFormulas that were not future-live. [2024-10-11 06:59:57,418 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:59:57,517 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:59:57,517 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:59:57,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:59:57 BoogieIcfgContainer [2024-10-11 06:59:57,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:59:57,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:59:57,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:59:57,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:59:57,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:59:52" (1/3) ... [2024-10-11 06:59:57,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e5d5b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:59:57, skipping insertion in model container [2024-10-11 06:59:57,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:53" (2/3) ... [2024-10-11 06:59:57,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e5d5b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:59:57, skipping insertion in model container [2024-10-11 06:59:57,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:59:57" (3/3) ... [2024-10-11 06:59:57,526 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2024-10-11 06:59:57,542 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:59:57,542 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:59:57,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:59:57,607 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;@37743298, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:59:57,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:59:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:59:57,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:57,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:59:57,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:57,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:57,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:59:57,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:59:57,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869030856] [2024-10-11 06:59:57,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:57,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:59:57,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:59:57,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:59:57,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 06:59:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:58,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 06:59:58,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:59:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:58,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:59:58,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:59:58,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869030856] [2024-10-11 06:59:58,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869030856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:58,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:58,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:59:58,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133227332] [2024-10-11 06:59:58,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:58,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:59:58,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:59:58,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:59:58,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:59:58,412 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:58,523 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-11 06:59:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:59:58,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 06:59:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:58,532 INFO L225 Difference]: With dead ends: 14 [2024-10-11 06:59:58,532 INFO L226 Difference]: Without dead ends: 8 [2024-10-11 06:59:58,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:59:58,541 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:58,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:59:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-11 06:59:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-11 06:59:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 06:59:58,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 06:59:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:58,572 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 06:59:58,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 06:59:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 06:59:58,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:58,573 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 06:59:58,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 06:59:58,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:59:58,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:58,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:58,775 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 06:59:58,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:59:58,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565901110] [2024-10-11 06:59:58,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:58,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:59:58,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:59:58,779 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:59:58,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 06:59:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:59,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 06:59:59,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:59:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:59,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:00:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:00:04,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:00:04,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565901110] [2024-10-11 07:00:04,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565901110] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:00:04,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:00:04,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 07:00:04,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639939847] [2024-10-11 07:00:04,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:00:04,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:00:04,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:00:04,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:00:04,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2024-10-11 07:00:04,172 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:00:04,407 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-11 07:00:04,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:00:04,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 07:00:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:00:04,409 INFO L225 Difference]: With dead ends: 13 [2024-10-11 07:00:04,409 INFO L226 Difference]: Without dead ends: 11 [2024-10-11 07:00:04,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2024-10-11 07:00:04,410 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:00:04,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:00:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-11 07:00:04,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-11 07:00:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:04,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-11 07:00:04,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-11 07:00:04,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:00:04,415 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-11 07:00:04,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:00:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-11 07:00:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 07:00:04,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:00:04,416 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-11 07:00:04,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 07:00:04,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:00:04,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:00:04,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:00:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-11 07:00:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:00:04,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886213337] [2024-10-11 07:00:04,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 07:00:04,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:00:04,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:00:04,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:00:04,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:00:05,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 07:00:05,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 07:00:05,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-11 07:00:05,786 INFO L278 TraceCheckSpWp]: Computing forward predicates...