./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_p4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:08:29,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:08:29,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 07:08:29,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:08:29,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:08:29,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:08:29,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:08:29,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:08:29,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:08:29,810 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:08:29,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:08:29,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:08:29,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:08:29,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:08:29,812 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:08:29,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:08:29,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:08:29,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:08:29,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:08:29,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:08:29,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:08:29,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:08:29,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:08:29,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:08:29,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:08:29,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:08:29,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:08:29,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:08:29,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:08:29,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:08:29,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:08:29,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:08:29,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:08:29,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:08:29,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:08:29,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:08:29,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:08:29,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:08:29,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:08:29,818 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e [2024-10-14 07:08:30,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:08:30,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:08:30,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:08:30,084 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:08:30,084 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:08:30,085 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_p4.c [2024-10-14 07:08:31,401 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:08:31,775 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:08:31,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2024-10-14 07:08:31,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7fe8c60/c024438b9d0348f08ec4ec8a09250732/FLAG48e320bae [2024-10-14 07:08:31,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7fe8c60/c024438b9d0348f08ec4ec8a09250732 [2024-10-14 07:08:31,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:08:31,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:08:31,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:08:31,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:08:31,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:08:31,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:08:31" (1/1) ... [2024-10-14 07:08:31,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d679ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:31, skipping insertion in model container [2024-10-14 07:08:31,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:08:31" (1/1) ... [2024-10-14 07:08:31,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:08:32,106 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_p4.c[1268,1281] [2024-10-14 07:08:32,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:08:32,444 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:08:32,454 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_p4.c[1268,1281] [2024-10-14 07:08:32,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:08:32,587 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:08:32,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32 WrapperNode [2024-10-14 07:08:32,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:08:32,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:08:32,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:08:32,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:08:32,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (1/1) ... [2024-10-14 07:08:32,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (1/1) ... [2024-10-14 07:08:33,049 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4813 [2024-10-14 07:08:33,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:08:33,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:08:33,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:08:33,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:08:33,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (1/1) ... [2024-10-14 07:08:33,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (1/1) ... [2024-10-14 07:08:33,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (1/1) ... [2024-10-14 07:08:33,223 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-14 07:08:33,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (1/1) ... [2024-10-14 07:08:33,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (1/1) ... [2024-10-14 07:08:33,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (1/1) ... [2024-10-14 07:08:33,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (1/1) ... [2024-10-14 07:08:33,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (1/1) ... [2024-10-14 07:08:33,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (1/1) ... [2024-10-14 07:08:33,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:08:33,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:08:33,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:08:33,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:08:33,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (1/1) ... [2024-10-14 07:08:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:08:33,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:08:33,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:08:33,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:08:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:08:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:08:33,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:08:33,962 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:08:33,964 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:08:37,712 INFO L? ?]: Removed 3115 outVars from TransFormulas that were not future-live. [2024-10-14 07:08:37,712 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:08:37,786 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:08:37,789 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:08:37,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:37 BoogieIcfgContainer [2024-10-14 07:08:37,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:08:37,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:08:37,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:08:37,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:08:37,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:08:31" (1/3) ... [2024-10-14 07:08:37,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509e64d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:08:37, skipping insertion in model container [2024-10-14 07:08:37,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32" (2/3) ... [2024-10-14 07:08:37,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509e64d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:08:37, skipping insertion in model container [2024-10-14 07:08:37,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:37" (3/3) ... [2024-10-14 07:08:37,797 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2024-10-14 07:08:37,809 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:08:37,809 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:08:37,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:08:37,865 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;@67fc3900, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:08:37,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:08:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 1107 states, 1105 states have (on average 1.5004524886877828) internal successors, (1658), 1106 states have internal predecessors, (1658), 0 states have call successors, (0), 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-14 07:08:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 07:08:37,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:37,878 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] [2024-10-14 07:08:37,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:37,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:37,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1976273717, now seen corresponding path program 1 times [2024-10-14 07:08:37,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:37,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307007755] [2024-10-14 07:08:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:38,518 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-14 07:08:38,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307007755] [2024-10-14 07:08:38,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307007755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:38,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:38,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:08:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564048224] [2024-10-14 07:08:38,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:38,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:08:38,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:38,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:08:38,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:08:38,543 INFO L87 Difference]: Start difference. First operand has 1107 states, 1105 states have (on average 1.5004524886877828) internal successors, (1658), 1106 states have internal predecessors, (1658), 0 states have call successors, (0), 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.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-14 07:08:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:38,636 INFO L93 Difference]: Finished difference Result 2098 states and 3144 transitions. [2024-10-14 07:08:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:08:38,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-14 07:08:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:38,652 INFO L225 Difference]: With dead ends: 2098 [2024-10-14 07:08:38,652 INFO L226 Difference]: Without dead ends: 1108 [2024-10-14 07:08:38,657 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-14 07:08:38,659 INFO L432 NwaCegarLoop]: 1653 mSDtfsCounter, 0 mSDsluCounter, 3301 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4954 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-14 07:08:38,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4954 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:08:38,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-10-14 07:08:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2024-10-14 07:08:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1107 states have (on average 1.4977416440831075) internal successors, (1658), 1107 states have internal predecessors, (1658), 0 states have call successors, (0), 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-14 07:08:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1658 transitions. [2024-10-14 07:08:38,719 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1658 transitions. Word has length 80 [2024-10-14 07:08:38,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:38,719 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1658 transitions. [2024-10-14 07:08:38,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-14 07:08:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1658 transitions. [2024-10-14 07:08:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 07:08:38,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:38,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:08:38,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:08:38,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:38,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:38,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1133247436, now seen corresponding path program 1 times [2024-10-14 07:08:38,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:38,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835976709] [2024-10-14 07:08:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:38,983 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-14 07:08:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835976709] [2024-10-14 07:08:38,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835976709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:38,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:38,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:08:38,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741245797] [2024-10-14 07:08:38,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:38,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:08:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:38,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:08:38,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:08:38,989 INFO L87 Difference]: Start difference. First operand 1108 states and 1658 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:39,036 INFO L93 Difference]: Finished difference Result 2101 states and 3144 transitions. [2024-10-14 07:08:39,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:08:39,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-14 07:08:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:39,040 INFO L225 Difference]: With dead ends: 2101 [2024-10-14 07:08:39,041 INFO L226 Difference]: Without dead ends: 1110 [2024-10-14 07:08:39,042 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-14 07:08:39,043 INFO L432 NwaCegarLoop]: 1653 mSDtfsCounter, 0 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4951 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-14 07:08:39,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4951 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:08:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2024-10-14 07:08:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2024-10-14 07:08:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 1.496844003606853) internal successors, (1660), 1109 states have internal predecessors, (1660), 0 states have call successors, (0), 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-14 07:08:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1660 transitions. [2024-10-14 07:08:39,065 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1660 transitions. Word has length 81 [2024-10-14 07:08:39,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:39,066 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1660 transitions. [2024-10-14 07:08:39,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1660 transitions. [2024-10-14 07:08:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 07:08:39,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:39,070 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-14 07:08:39,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:08:39,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:39,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1868897596, now seen corresponding path program 1 times [2024-10-14 07:08:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:39,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760392969] [2024-10-14 07:08:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:39,988 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-14 07:08:39,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:39,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760392969] [2024-10-14 07:08:39,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760392969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:39,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:39,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:08:39,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298484813] [2024-10-14 07:08:39,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:39,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:08:39,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:39,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:08:39,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:08:39,993 INFO L87 Difference]: Start difference. First operand 1110 states and 1660 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 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-14 07:08:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:40,276 INFO L93 Difference]: Finished difference Result 2991 states and 4473 transitions. [2024-10-14 07:08:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:08:40,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 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-14 07:08:40,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:40,283 INFO L225 Difference]: With dead ends: 2991 [2024-10-14 07:08:40,283 INFO L226 Difference]: Without dead ends: 1998 [2024-10-14 07:08:40,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:08:40,285 INFO L432 NwaCegarLoop]: 1627 mSDtfsCounter, 4237 mSDsluCounter, 6505 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4237 SdHoareTripleChecker+Valid, 8132 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:40,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4237 Valid, 8132 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:08:40,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2024-10-14 07:08:40,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1120. [2024-10-14 07:08:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 1.4950848972296693) internal successors, (1673), 1119 states have internal predecessors, (1673), 0 states have call successors, (0), 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-14 07:08:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1673 transitions. [2024-10-14 07:08:40,307 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1673 transitions. Word has length 82 [2024-10-14 07:08:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:40,308 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1673 transitions. [2024-10-14 07:08:40,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 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-14 07:08:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1673 transitions. [2024-10-14 07:08:40,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 07:08:40,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:40,309 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-14 07:08:40,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:08:40,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:40,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:40,310 INFO L85 PathProgramCache]: Analyzing trace with hash 354202455, now seen corresponding path program 1 times [2024-10-14 07:08:40,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:40,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530559330] [2024-10-14 07:08:40,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:40,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:40,991 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-14 07:08:40,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:40,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530559330] [2024-10-14 07:08:40,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530559330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:40,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:40,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 07:08:40,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343981915] [2024-10-14 07:08:40,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:40,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 07:08:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:40,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 07:08:40,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:08:40,993 INFO L87 Difference]: Start difference. First operand 1120 states and 1673 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:41,375 INFO L93 Difference]: Finished difference Result 2995 states and 4476 transitions. [2024-10-14 07:08:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 07:08:41,376 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-10-14 07:08:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:41,382 INFO L225 Difference]: With dead ends: 2995 [2024-10-14 07:08:41,382 INFO L226 Difference]: Without dead ends: 2002 [2024-10-14 07:08:41,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-10-14 07:08:41,384 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 4249 mSDsluCounter, 9400 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 11023 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:41,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 11023 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:08:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2024-10-14 07:08:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1122. [2024-10-14 07:08:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4942016057091883) internal successors, (1675), 1121 states have internal predecessors, (1675), 0 states have call successors, (0), 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-14 07:08:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1675 transitions. [2024-10-14 07:08:41,403 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1675 transitions. Word has length 83 [2024-10-14 07:08:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:41,403 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1675 transitions. [2024-10-14 07:08:41,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:41,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1675 transitions. [2024-10-14 07:08:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:08:41,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:41,404 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-14 07:08:41,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:08:41,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:41,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:41,405 INFO L85 PathProgramCache]: Analyzing trace with hash -752389855, now seen corresponding path program 1 times [2024-10-14 07:08:41,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:41,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351115462] [2024-10-14 07:08:41,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:41,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:41,712 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-14 07:08:41,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351115462] [2024-10-14 07:08:41,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351115462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:41,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:41,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:08:41,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446893102] [2024-10-14 07:08:41,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:41,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:08:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:41,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:08:41,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:08:41,715 INFO L87 Difference]: Start difference. First operand 1122 states and 1675 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 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-14 07:08:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:41,872 INFO L93 Difference]: Finished difference Result 2986 states and 4462 transitions. [2024-10-14 07:08:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:08:41,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 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-14 07:08:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:41,878 INFO L225 Difference]: With dead ends: 2986 [2024-10-14 07:08:41,878 INFO L226 Difference]: Without dead ends: 1992 [2024-10-14 07:08:41,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:08:41,880 INFO L432 NwaCegarLoop]: 1632 mSDtfsCounter, 4217 mSDsluCounter, 3260 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4217 SdHoareTripleChecker+Valid, 4892 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:41,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4217 Valid, 4892 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:08:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2024-10-14 07:08:41,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1121. [2024-10-14 07:08:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.49375) internal successors, (1673), 1120 states have internal predecessors, (1673), 0 states have call successors, (0), 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-14 07:08:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1673 transitions. [2024-10-14 07:08:41,900 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1673 transitions. Word has length 84 [2024-10-14 07:08:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:41,901 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1673 transitions. [2024-10-14 07:08:41,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 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-14 07:08:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1673 transitions. [2024-10-14 07:08:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:08:41,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:41,901 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-14 07:08:41,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:08:41,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:41,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1468286877, now seen corresponding path program 1 times [2024-10-14 07:08:41,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:41,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914531408] [2024-10-14 07:08:41,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:41,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:08:42,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:42,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914531408] [2024-10-14 07:08:42,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914531408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:42,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:42,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:08:42,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013578874] [2024-10-14 07:08:42,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:42,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:08:42,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:42,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:08:42,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:08:42,355 INFO L87 Difference]: Start difference. First operand 1121 states and 1673 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-14 07:08:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:42,613 INFO L93 Difference]: Finished difference Result 2988 states and 4465 transitions. [2024-10-14 07:08:42,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:08:42,613 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-14 07:08:42,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:42,619 INFO L225 Difference]: With dead ends: 2988 [2024-10-14 07:08:42,620 INFO L226 Difference]: Without dead ends: 1995 [2024-10-14 07:08:42,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-14 07:08:42,622 INFO L432 NwaCegarLoop]: 1629 mSDtfsCounter, 4216 mSDsluCounter, 6169 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4216 SdHoareTripleChecker+Valid, 7798 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:42,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4216 Valid, 7798 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:08:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2024-10-14 07:08:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1125. [2024-10-14 07:08:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.49288256227758) internal successors, (1678), 1124 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1678 transitions. [2024-10-14 07:08:42,644 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1678 transitions. Word has length 84 [2024-10-14 07:08:42,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:42,644 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1678 transitions. [2024-10-14 07:08:42,650 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-14 07:08:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1678 transitions. [2024-10-14 07:08:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:08:42,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:42,651 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-14 07:08:42,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 07:08:42,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:42,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:42,652 INFO L85 PathProgramCache]: Analyzing trace with hash 113563060, now seen corresponding path program 1 times [2024-10-14 07:08:42,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:42,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636312522] [2024-10-14 07:08:42,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:42,897 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-14 07:08:42,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:42,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636312522] [2024-10-14 07:08:42,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636312522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:42,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:42,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:08:42,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049649299] [2024-10-14 07:08:42,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:42,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:08:42,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:42,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:08:42,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:08:42,900 INFO L87 Difference]: Start difference. First operand 1125 states and 1678 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-14 07:08:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:43,053 INFO L93 Difference]: Finished difference Result 2983 states and 4456 transitions. [2024-10-14 07:08:43,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:08:43,054 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-14 07:08:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:43,059 INFO L225 Difference]: With dead ends: 2983 [2024-10-14 07:08:43,059 INFO L226 Difference]: Without dead ends: 1990 [2024-10-14 07:08:43,061 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-14 07:08:43,061 INFO L432 NwaCegarLoop]: 1631 mSDtfsCounter, 4202 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4202 SdHoareTripleChecker+Valid, 4890 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:43,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4202 Valid, 4890 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:08:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2024-10-14 07:08:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1125. [2024-10-14 07:08:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.4919928825622777) internal successors, (1677), 1124 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1677 transitions. [2024-10-14 07:08:43,079 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1677 transitions. Word has length 85 [2024-10-14 07:08:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:43,080 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1677 transitions. [2024-10-14 07:08:43,080 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-14 07:08:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1677 transitions. [2024-10-14 07:08:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:08:43,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:43,081 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-14 07:08:43,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 07:08:43,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:43,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1395841232, now seen corresponding path program 1 times [2024-10-14 07:08:43,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:43,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397968314] [2024-10-14 07:08:43,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:43,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:43,601 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-14 07:08:43,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:43,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397968314] [2024-10-14 07:08:43,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397968314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:43,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:43,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 07:08:43,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523082792] [2024-10-14 07:08:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:43,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:08:43,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:43,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:08:43,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:08:43,603 INFO L87 Difference]: Start difference. First operand 1125 states and 1677 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:43,807 INFO L93 Difference]: Finished difference Result 2123 states and 3169 transitions. [2024-10-14 07:08:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:08:43,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-14 07:08:43,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:43,811 INFO L225 Difference]: With dead ends: 2123 [2024-10-14 07:08:43,811 INFO L226 Difference]: Without dead ends: 1130 [2024-10-14 07:08:43,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:08:43,813 INFO L432 NwaCegarLoop]: 1638 mSDtfsCounter, 1640 mSDsluCounter, 8185 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 9823 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:43,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 9823 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:08:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-10-14 07:08:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1127. [2024-10-14 07:08:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1126 states have (on average 1.4911190053285968) internal successors, (1679), 1126 states have internal predecessors, (1679), 0 states have call successors, (0), 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-14 07:08:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1679 transitions. [2024-10-14 07:08:43,833 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1679 transitions. Word has length 85 [2024-10-14 07:08:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:43,833 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1679 transitions. [2024-10-14 07:08:43,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1679 transitions. [2024-10-14 07:08:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 07:08:43,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:43,834 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-14 07:08:43,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 07:08:43,835 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:43,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1375462646, now seen corresponding path program 1 times [2024-10-14 07:08:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:43,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990871776] [2024-10-14 07:08:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:43,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:44,685 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-14 07:08:44,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:44,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990871776] [2024-10-14 07:08:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990871776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:44,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-14 07:08:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683325216] [2024-10-14 07:08:44,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:44,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 07:08:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:44,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 07:08:44,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-14 07:08:44,688 INFO L87 Difference]: Start difference. First operand 1127 states and 1679 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 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-14 07:08:45,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:45,299 INFO L93 Difference]: Finished difference Result 2144 states and 3200 transitions. [2024-10-14 07:08:45,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 07:08:45,299 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 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-14 07:08:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:45,303 INFO L225 Difference]: With dead ends: 2144 [2024-10-14 07:08:45,304 INFO L226 Difference]: Without dead ends: 1151 [2024-10-14 07:08:45,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2024-10-14 07:08:45,308 INFO L432 NwaCegarLoop]: 1625 mSDtfsCounter, 1631 mSDsluCounter, 24350 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 25975 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:45,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 25975 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:08:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-10-14 07:08:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1145. [2024-10-14 07:08:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1144 states have (on average 1.493006993006993) internal successors, (1708), 1144 states have internal predecessors, (1708), 0 states have call successors, (0), 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-14 07:08:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1708 transitions. [2024-10-14 07:08:45,327 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1708 transitions. Word has length 86 [2024-10-14 07:08:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:45,327 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1708 transitions. [2024-10-14 07:08:45,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 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-14 07:08:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1708 transitions. [2024-10-14 07:08:45,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 07:08:45,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:45,328 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-14 07:08:45,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 07:08:45,330 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:45,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1254214661, now seen corresponding path program 1 times [2024-10-14 07:08:45,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:45,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598293799] [2024-10-14 07:08:45,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:45,920 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-14 07:08:45,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:45,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598293799] [2024-10-14 07:08:45,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598293799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:45,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:45,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 07:08:45,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813346356] [2024-10-14 07:08:45,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:45,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:08:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:45,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:08:45,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:08:45,923 INFO L87 Difference]: Start difference. First operand 1145 states and 1708 transitions. Second operand has 8 states, 8 states have (on average 10.875) 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-14 07:08:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:46,043 INFO L93 Difference]: Finished difference Result 2164 states and 3234 transitions. [2024-10-14 07:08:46,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:08:46,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) 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-14 07:08:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:46,047 INFO L225 Difference]: With dead ends: 2164 [2024-10-14 07:08:46,047 INFO L226 Difference]: Without dead ends: 1153 [2024-10-14 07:08:46,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:08:46,049 INFO L432 NwaCegarLoop]: 1644 mSDtfsCounter, 17 mSDsluCounter, 9830 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 11474 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:46,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 11474 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:08:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-10-14 07:08:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1150. [2024-10-14 07:08:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.4917319408181027) internal successors, (1714), 1149 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-14 07:08:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1714 transitions. [2024-10-14 07:08:46,063 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1714 transitions. Word has length 87 [2024-10-14 07:08:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:46,063 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1714 transitions. [2024-10-14 07:08:46,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) 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-14 07:08:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1714 transitions. [2024-10-14 07:08:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 07:08:46,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:46,064 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-14 07:08:46,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 07:08:46,065 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:46,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:46,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1130974637, now seen corresponding path program 1 times [2024-10-14 07:08:46,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:46,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750646753] [2024-10-14 07:08:46,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:46,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:46,955 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-14 07:08:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:46,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750646753] [2024-10-14 07:08:46,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750646753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:46,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:46,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 07:08:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854613722] [2024-10-14 07:08:46,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:46,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 07:08:46,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:46,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 07:08:46,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:08:46,957 INFO L87 Difference]: Start difference. First operand 1150 states and 1714 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 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-14 07:08:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:47,285 INFO L93 Difference]: Finished difference Result 2169 states and 3237 transitions. [2024-10-14 07:08:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 07:08:47,286 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 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-14 07:08:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:47,289 INFO L225 Difference]: With dead ends: 2169 [2024-10-14 07:08:47,290 INFO L226 Difference]: Without dead ends: 1153 [2024-10-14 07:08:47,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:08:47,291 INFO L432 NwaCegarLoop]: 1638 mSDtfsCounter, 5 mSDsluCounter, 17979 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19617 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:47,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 19617 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 07:08:47,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-10-14 07:08:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1150. [2024-10-14 07:08:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.4908616187989556) internal successors, (1713), 1149 states have internal predecessors, (1713), 0 states have call successors, (0), 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-14 07:08:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1713 transitions. [2024-10-14 07:08:47,307 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1713 transitions. Word has length 87 [2024-10-14 07:08:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:47,308 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1713 transitions. [2024-10-14 07:08:47,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 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-14 07:08:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1713 transitions. [2024-10-14 07:08:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 07:08:47,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:47,308 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-14 07:08:47,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 07:08:47,308 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:47,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1355043694, now seen corresponding path program 1 times [2024-10-14 07:08:47,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:47,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679114069] [2024-10-14 07:08:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:47,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:47,486 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-14 07:08:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679114069] [2024-10-14 07:08:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679114069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:47,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:47,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:08:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070019340] [2024-10-14 07:08:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:47,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:08:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:08:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:08:47,488 INFO L87 Difference]: Start difference. First operand 1150 states and 1713 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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-14 07:08:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:47,512 INFO L93 Difference]: Finished difference Result 2163 states and 3228 transitions. [2024-10-14 07:08:47,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:08:47,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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-14 07:08:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:47,515 INFO L225 Difference]: With dead ends: 2163 [2024-10-14 07:08:47,515 INFO L226 Difference]: Without dead ends: 1147 [2024-10-14 07:08:47,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:08:47,516 INFO L432 NwaCegarLoop]: 1650 mSDtfsCounter, 1 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:47,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3298 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:08:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2024-10-14 07:08:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1144. [2024-10-14 07:08:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.4908136482939633) internal successors, (1704), 1143 states have internal predecessors, (1704), 0 states have call successors, (0), 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-14 07:08:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1704 transitions. [2024-10-14 07:08:47,529 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1704 transitions. Word has length 88 [2024-10-14 07:08:47,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:47,529 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1704 transitions. [2024-10-14 07:08:47,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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-14 07:08:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1704 transitions. [2024-10-14 07:08:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 07:08:47,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:47,530 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-14 07:08:47,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 07:08:47,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:47,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:47,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1694724787, now seen corresponding path program 1 times [2024-10-14 07:08:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:47,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457807228] [2024-10-14 07:08:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:08:47,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:08:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:08:47,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:08:47,667 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:08:47,668 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:08:47,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 07:08:47,671 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:08:47,727 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:08:47,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:08:47 BoogieIcfgContainer [2024-10-14 07:08:47,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:08:47,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:08:47,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:08:47,730 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:08:47,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:37" (3/4) ... [2024-10-14 07:08:47,732 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:08:47,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:08:47,733 INFO L158 Benchmark]: Toolchain (without parser) took 15923.57ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 954.2MB). Free memory was 94.4MB in the beginning and 680.2MB in the end (delta: -585.8MB). Peak memory consumption was 369.4MB. Max. memory is 16.1GB. [2024-10-14 07:08:47,733 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:08:47,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 780.94ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 60.2MB in the end (delta: 34.0MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2024-10-14 07:08:47,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 457.57ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 60.2MB in the beginning and 167.8MB in the end (delta: -107.6MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-10-14 07:08:47,734 INFO L158 Benchmark]: Boogie Preprocessor took 468.22ms. Allocated memory is still 268.4MB. Free memory was 167.8MB in the beginning and 143.7MB in the end (delta: 24.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-10-14 07:08:47,734 INFO L158 Benchmark]: RCFGBuilder took 4271.35ms. Allocated memory was 268.4MB in the beginning and 536.9MB in the end (delta: 268.4MB). Free memory was 143.7MB in the beginning and 247.3MB in the end (delta: -103.7MB). Peak memory consumption was 290.4MB. Max. memory is 16.1GB. [2024-10-14 07:08:47,734 INFO L158 Benchmark]: TraceAbstraction took 9937.35ms. Allocated memory was 536.9MB in the beginning and 1.1GB in the end (delta: 585.1MB). Free memory was 246.3MB in the beginning and 681.3MB in the end (delta: -435.0MB). Peak memory consumption was 150.1MB. Max. memory is 16.1GB. [2024-10-14 07:08:47,734 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 1.1GB. Free memory was 681.3MB in the beginning and 680.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:08:47,735 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.10ms. Allocated memory is still 167.8MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 780.94ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 60.2MB in the end (delta: 34.0MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 457.57ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 60.2MB in the beginning and 167.8MB in the end (delta: -107.6MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 468.22ms. Allocated memory is still 268.4MB. Free memory was 167.8MB in the beginning and 143.7MB in the end (delta: 24.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * RCFGBuilder took 4271.35ms. Allocated memory was 268.4MB in the beginning and 536.9MB in the end (delta: 268.4MB). Free memory was 143.7MB in the beginning and 247.3MB in the end (delta: -103.7MB). Peak memory consumption was 290.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9937.35ms. Allocated memory was 536.9MB in the beginning and 1.1GB in the end (delta: 585.1MB). Free memory was 246.3MB in the beginning and 681.3MB in the end (delta: -435.0MB). Peak memory consumption was 150.1MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 1.1GB. Free memory was 681.3MB in the beginning and 680.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 376. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_28 = 0; [L46] const SORT_21 var_32 = 2; [L47] const SORT_21 var_35 = 4; [L48] const SORT_21 var_38 = 64; [L49] const SORT_3 var_45 = 1; [L50] const SORT_3 var_49 = 0; [L51] const SORT_6 var_134 = 0; [L52] const SORT_21 var_728 = 8; [L53] const SORT_21 var_748 = 16; [L54] const SORT_21 var_763 = 32; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_356; [L72] SORT_3 input_378; [L73] SORT_3 input_393; [L74] SORT_3 input_408; [L75] SORT_3 input_423; [L76] SORT_3 input_438; [L77] SORT_3 input_453; [L78] SORT_3 input_468; [L79] SORT_3 input_483; [L80] SORT_3 input_498; [L81] SORT_3 input_513; [L82] SORT_3 input_528; [L83] SORT_3 input_543; [L84] SORT_3 input_558; [L85] SORT_3 input_573; [L86] SORT_3 input_588; [L87] SORT_3 input_604; [L88] SORT_3 input_606; [L89] SORT_3 input_608; [L90] SORT_3 input_610; [L91] SORT_3 input_612; [L92] SORT_3 input_614; [L93] SORT_3 input_616; [L94] SORT_3 input_618; [L95] SORT_3 input_623; [L96] SORT_21 input_664; [L97] SORT_21 input_665; [L98] SORT_21 input_666; [L99] SORT_21 input_667; [L100] SORT_21 input_670; [L101] SORT_21 input_674; [L102] SORT_21 input_678; [L103] SORT_21 input_686; [L104] SORT_21 input_690; [L105] SORT_21 input_692; [L106] SORT_21 input_696; [L107] SORT_21 input_699; [L108] SORT_21 input_703; [L109] SORT_21 input_708; [L110] SORT_21 input_712; [L111] SORT_21 input_717; [L112] SORT_21 input_719; [L113] SORT_21 input_720; [L114] SORT_21 input_722; [L115] SORT_21 input_726; [L116] SORT_21 input_732; [L117] SORT_21 input_739; [L118] SORT_21 input_740; [L119] SORT_21 input_742; [L120] SORT_21 input_746; [L121] SORT_21 input_752; [L122] SORT_21 input_754; [L123] SORT_21 input_755; [L124] SORT_21 input_757; [L125] SORT_21 input_761; [L126] SORT_21 input_767; [L127] SORT_21 input_771; [L128] SORT_21 input_776; [L129] SORT_21 input_778; [L130] SORT_21 input_784; [L131] SORT_21 input_796; [L132] SORT_3 input_801; [L133] SORT_3 input_810; [L134] SORT_3 input_829; [L135] SORT_3 input_836; [L136] SORT_3 input_847; [L137] SORT_3 input_853; [L138] SORT_3 input_859; [L139] SORT_3 input_865; [L140] SORT_3 input_871; [L141] SORT_3 input_877; [L142] SORT_3 input_883; [L143] SORT_3 input_889; [L144] SORT_3 input_895; [L145] SORT_3 input_901; [L146] SORT_3 input_907; [L147] SORT_3 input_913; [L148] SORT_3 input_919; [L150] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L151] SORT_21 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L152] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L152] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L153] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L153] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L154] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L155] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L155] SORT_3 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L156] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L156] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L157] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L157] SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L158] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L158] SORT_3 state_82 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L159] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L159] SORT_3 state_99 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L160] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L160] SORT_3 state_102 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L161] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L161] SORT_3 state_104 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L162] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L162] SORT_3 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L163] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L163] SORT_3 state_112 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L164] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L164] SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L165] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L165] SORT_3 state_120 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L166] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L166] SORT_3 state_130 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L167] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L167] SORT_3 state_137 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L168] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L168] SORT_3 state_140 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L169] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L169] SORT_3 state_149 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L170] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L170] SORT_3 state_154 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L171] SORT_3 state_157 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L172] SORT_3 state_169 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L173] SORT_3 state_179 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L174] SORT_3 state_184 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L175] SORT_3 state_187 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L176] SORT_3 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L177] SORT_3 state_209 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L178] SORT_3 state_222 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_21 init_27_arg_1 = var_22; [L183] state_26 = init_27_arg_1 [L184] SORT_3 init_51_arg_1 = var_49; [L185] state_50 = init_51_arg_1 [L186] SORT_3 init_53_arg_1 = var_49; [L187] state_52 = init_53_arg_1 [L188] SORT_3 init_55_arg_1 = var_49; [L189] state_54 = init_55_arg_1 [L190] SORT_3 init_59_arg_1 = var_49; [L191] state_58 = init_59_arg_1 [L192] SORT_3 init_63_arg_1 = var_49; [L193] state_62 = init_63_arg_1 [L194] SORT_3 init_67_arg_1 = var_49; [L195] state_66 = init_67_arg_1 [L196] SORT_3 init_83_arg_1 = var_49; [L197] state_82 = init_83_arg_1 [L198] SORT_3 init_100_arg_1 = var_49; [L199] state_99 = init_100_arg_1 [L200] SORT_3 init_103_arg_1 = var_49; [L201] state_102 = init_103_arg_1 [L202] SORT_3 init_105_arg_1 = var_49; [L203] state_104 = init_105_arg_1 [L204] SORT_3 init_109_arg_1 = var_49; [L205] state_108 = init_109_arg_1 [L206] SORT_3 init_113_arg_1 = var_49; [L207] state_112 = init_113_arg_1 [L208] SORT_3 init_118_arg_1 = var_49; [L209] state_117 = init_118_arg_1 [L210] SORT_3 init_121_arg_1 = var_49; [L211] state_120 = init_121_arg_1 [L212] SORT_3 init_131_arg_1 = var_49; [L213] state_130 = init_131_arg_1 [L214] SORT_3 init_138_arg_1 = var_49; [L215] state_137 = init_138_arg_1 [L216] SORT_3 init_141_arg_1 = var_49; [L217] state_140 = init_141_arg_1 [L218] SORT_3 init_150_arg_1 = var_49; [L219] state_149 = init_150_arg_1 [L220] SORT_3 init_155_arg_1 = var_49; [L221] state_154 = init_155_arg_1 [L222] SORT_3 init_158_arg_1 = var_49; [L223] state_157 = init_158_arg_1 [L224] SORT_3 init_170_arg_1 = var_49; [L225] state_169 = init_170_arg_1 [L226] SORT_3 init_180_arg_1 = var_49; [L227] state_179 = init_180_arg_1 [L228] SORT_3 init_185_arg_1 = var_49; [L229] state_184 = init_185_arg_1 [L230] SORT_3 init_188_arg_1 = var_49; [L231] state_187 = init_188_arg_1 [L232] SORT_3 init_197_arg_1 = var_49; [L233] state_196 = init_197_arg_1 [L234] SORT_3 init_210_arg_1 = var_49; [L235] state_209 = init_210_arg_1 [L236] SORT_3 init_223_arg_1 = var_49; [L237] state_222 = init_223_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_356 = __VERIFIER_nondet_uchar() [L257] input_378 = __VERIFIER_nondet_uchar() [L258] input_393 = __VERIFIER_nondet_uchar() [L259] input_408 = __VERIFIER_nondet_uchar() [L260] input_423 = __VERIFIER_nondet_uchar() [L261] input_438 = __VERIFIER_nondet_uchar() [L262] input_453 = __VERIFIER_nondet_uchar() [L263] input_468 = __VERIFIER_nondet_uchar() [L264] input_483 = __VERIFIER_nondet_uchar() [L265] input_498 = __VERIFIER_nondet_uchar() [L266] input_513 = __VERIFIER_nondet_uchar() [L267] input_528 = __VERIFIER_nondet_uchar() [L268] input_543 = __VERIFIER_nondet_uchar() [L269] input_558 = __VERIFIER_nondet_uchar() [L270] input_573 = __VERIFIER_nondet_uchar() [L271] input_588 = __VERIFIER_nondet_uchar() [L272] input_604 = __VERIFIER_nondet_uchar() [L273] input_606 = __VERIFIER_nondet_uchar() [L274] input_608 = __VERIFIER_nondet_uchar() [L275] input_610 = __VERIFIER_nondet_uchar() [L276] input_612 = __VERIFIER_nondet_uchar() [L277] input_614 = __VERIFIER_nondet_uchar() [L278] input_616 = __VERIFIER_nondet_uchar() [L279] input_618 = __VERIFIER_nondet_uchar() [L280] input_623 = __VERIFIER_nondet_uchar() [L281] input_664 = __VERIFIER_nondet_uchar() [L282] input_665 = __VERIFIER_nondet_uchar() [L283] input_666 = __VERIFIER_nondet_uchar() [L284] input_667 = __VERIFIER_nondet_uchar() [L285] input_670 = __VERIFIER_nondet_uchar() [L286] input_674 = __VERIFIER_nondet_uchar() [L287] input_678 = __VERIFIER_nondet_uchar() [L288] input_686 = __VERIFIER_nondet_uchar() [L289] input_690 = __VERIFIER_nondet_uchar() [L290] input_692 = __VERIFIER_nondet_uchar() [L291] input_696 = __VERIFIER_nondet_uchar() [L292] input_699 = __VERIFIER_nondet_uchar() [L293] input_703 = __VERIFIER_nondet_uchar() [L294] input_708 = __VERIFIER_nondet_uchar() [L295] input_712 = __VERIFIER_nondet_uchar() [L296] input_717 = __VERIFIER_nondet_uchar() [L297] input_719 = __VERIFIER_nondet_uchar() [L298] input_720 = __VERIFIER_nondet_uchar() [L299] input_722 = __VERIFIER_nondet_uchar() [L300] input_726 = __VERIFIER_nondet_uchar() [L301] input_732 = __VERIFIER_nondet_uchar() [L302] input_739 = __VERIFIER_nondet_uchar() [L303] input_740 = __VERIFIER_nondet_uchar() [L304] input_742 = __VERIFIER_nondet_uchar() [L305] input_746 = __VERIFIER_nondet_uchar() [L306] input_752 = __VERIFIER_nondet_uchar() [L307] input_754 = __VERIFIER_nondet_uchar() [L308] input_755 = __VERIFIER_nondet_uchar() [L309] input_757 = __VERIFIER_nondet_uchar() [L310] input_761 = __VERIFIER_nondet_uchar() [L311] input_767 = __VERIFIER_nondet_uchar() [L312] input_771 = __VERIFIER_nondet_uchar() [L313] input_776 = __VERIFIER_nondet_uchar() [L314] input_778 = __VERIFIER_nondet_uchar() [L315] input_784 = __VERIFIER_nondet_uchar() [L316] input_796 = __VERIFIER_nondet_uchar() [L317] input_801 = __VERIFIER_nondet_uchar() [L318] input_810 = __VERIFIER_nondet_uchar() [L319] input_829 = __VERIFIER_nondet_uchar() [L320] input_836 = __VERIFIER_nondet_uchar() [L321] input_847 = __VERIFIER_nondet_uchar() [L322] input_853 = __VERIFIER_nondet_uchar() [L323] input_859 = __VERIFIER_nondet_uchar() [L324] input_865 = __VERIFIER_nondet_uchar() [L325] input_871 = __VERIFIER_nondet_uchar() [L326] input_877 = __VERIFIER_nondet_uchar() [L327] input_883 = __VERIFIER_nondet_uchar() [L328] input_889 = __VERIFIER_nondet_uchar() [L329] input_895 = __VERIFIER_nondet_uchar() [L330] input_901 = __VERIFIER_nondet_uchar() [L331] input_907 = __VERIFIER_nondet_uchar() [L332] input_913 = __VERIFIER_nondet_uchar() [L333] input_919 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_29_arg_0 = state_26; [L340] SORT_21 var_29_arg_1 = var_28; [L341] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L342] SORT_21 var_30_arg_0 = state_26; [L343] SORT_21 var_30_arg_1 = var_22; [L344] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L345] SORT_3 var_31_arg_0 = var_29; [L346] SORT_3 var_31_arg_1 = var_30; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_31_arg_0=0, var_31_arg_1=1, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L347] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L347] SORT_3 var_31 = var_31_arg_0 | var_31_arg_1; [L348] SORT_21 var_33_arg_0 = state_26; [L349] SORT_21 var_33_arg_1 = var_32; [L350] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L351] SORT_3 var_34_arg_0 = var_31; [L352] SORT_3 var_34_arg_1 = var_33; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_34_arg_0=1, var_34_arg_1=0, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L353] EXPR var_34_arg_0 | var_34_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L353] SORT_3 var_34 = var_34_arg_0 | var_34_arg_1; [L354] SORT_21 var_36_arg_0 = state_26; [L355] SORT_21 var_36_arg_1 = var_35; [L356] SORT_3 var_36 = var_36_arg_0 == var_36_arg_1; [L357] SORT_3 var_37_arg_0 = var_34; [L358] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_37_arg_0=1, var_37_arg_1=0, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L359] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L359] SORT_3 var_37 = var_37_arg_0 | var_37_arg_1; [L360] SORT_21 var_39_arg_0 = state_26; [L361] SORT_21 var_39_arg_1 = var_38; [L362] SORT_3 var_39 = var_39_arg_0 == var_39_arg_1; [L363] SORT_3 var_40_arg_0 = var_37; [L364] SORT_3 var_40_arg_1 = var_39; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_40_arg_0=1, var_40_arg_1=0, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L365] EXPR var_40_arg_0 | var_40_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L365] SORT_3 var_40 = var_40_arg_0 | var_40_arg_1; [L366] SORT_3 var_41_arg_0 = var_25; [L367] SORT_3 var_41_arg_1 = var_40; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_41_arg_0=1, var_41_arg_1=1, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L368] EXPR var_41_arg_0 & var_41_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L368] SORT_3 var_41 = var_41_arg_0 & var_41_arg_1; [L369] SORT_21 var_42_arg_0 = state_23; [L370] SORT_21 var_42_arg_1 = var_22; [L371] SORT_3 var_42 = var_42_arg_0 == var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_42; [L373] SORT_3 var_43 = ~var_43_arg_0; [L374] SORT_3 var_44_arg_0 = var_41; [L375] SORT_3 var_44_arg_1 = var_43; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_44_arg_0=1, var_44_arg_1=-2, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L376] EXPR var_44_arg_0 | var_44_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L376] SORT_3 var_44 = var_44_arg_0 | var_44_arg_1; [L377] SORT_3 var_46_arg_0 = var_44; [L378] SORT_3 var_46 = ~var_46_arg_0; [L379] SORT_3 var_47_arg_0 = var_45; [L380] SORT_3 var_47_arg_1 = var_46; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_47_arg_0=1, var_47_arg_1=-255, var_49=0, var_728=8, var_748=16, var_763=32] [L381] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L381] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L382] EXPR var_47 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L382] var_47 = var_47 & mask_SORT_3 [L383] SORT_3 bad_48_arg_0 = var_47; [L384] CALL __VERIFIER_assert(!(bad_48_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24415 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24415 mSDsluCounter, 116827 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97184 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1866 IncrementalHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 19643 mSDtfsCounter, 1866 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1150occurred in iteration=10, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 4382 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1100 NumberOfCodeBlocks, 1100 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 4341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-14 07:08:47,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:08:50,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:08:50,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 07:08:50,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:08:50,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:08:50,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:08:50,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:08:50,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:08:50,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:08:50,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:08:50,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:08:50,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:08:50,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:08:50,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:08:50,232 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:08:50,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:08:50,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:08:50,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:08:50,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:08:50,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:08:50,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:08:50,234 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:08:50,234 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:08:50,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:08:50,235 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:08:50,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:08:50,235 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:08:50,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:08:50,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:08:50,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:08:50,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:08:50,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:08:50,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:08:50,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:08:50,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:08:50,246 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:08:50,246 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:08:50,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:08:50,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:08:50,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:08:50,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:08:50,247 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:08:50,247 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e [2024-10-14 07:08:50,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:08:50,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:08:50,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:08:50,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:08:50,604 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:08:50,605 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_p4.c [2024-10-14 07:08:52,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:08:52,330 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:08:52,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2024-10-14 07:08:52,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce3a8712/16d047b0f99f4b72a7d206e8cd9d0a04/FLAGc56009465 [2024-10-14 07:08:52,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce3a8712/16d047b0f99f4b72a7d206e8cd9d0a04 [2024-10-14 07:08:52,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:08:52,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:08:52,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:08:52,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:08:52,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:08:52,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:08:52" (1/1) ... [2024-10-14 07:08:52,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c42a920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:52, skipping insertion in model container [2024-10-14 07:08:52,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:08:52" (1/1) ... [2024-10-14 07:08:52,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:08:52,624 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_p4.c[1268,1281] [2024-10-14 07:08:52,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:08:52,968 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:08:52,980 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_p4.c[1268,1281] [2024-10-14 07:08:53,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:08:53,133 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:08:53,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53 WrapperNode [2024-10-14 07:08:53,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:08:53,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:08:53,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:08:53,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:08:53,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (1/1) ... [2024-10-14 07:08:53,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (1/1) ... [2024-10-14 07:08:53,350 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2613 [2024-10-14 07:08:53,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:08:53,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:08:53,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:08:53,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:08:53,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (1/1) ... [2024-10-14 07:08:53,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (1/1) ... [2024-10-14 07:08:53,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (1/1) ... [2024-10-14 07:08:53,450 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-14 07:08:53,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (1/1) ... [2024-10-14 07:08:53,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (1/1) ... [2024-10-14 07:08:53,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (1/1) ... [2024-10-14 07:08:53,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (1/1) ... [2024-10-14 07:08:53,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (1/1) ... [2024-10-14 07:08:53,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (1/1) ... [2024-10-14 07:08:53,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:08:53,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:08:53,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:08:53,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:08:53,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (1/1) ... [2024-10-14 07:08:53,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:08:53,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:08:53,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:08:53,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:08:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:08:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:08:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:08:53,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:08:53,975 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:08:53,977 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:08:56,416 INFO L? ?]: Removed 155 outVars from TransFormulas that were not future-live. [2024-10-14 07:08:56,417 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:08:56,494 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:08:56,494 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:08:56,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:56 BoogieIcfgContainer [2024-10-14 07:08:56,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:08:56,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:08:56,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:08:56,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:08:56,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:08:52" (1/3) ... [2024-10-14 07:08:56,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da4417c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:08:56, skipping insertion in model container [2024-10-14 07:08:56,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:53" (2/3) ... [2024-10-14 07:08:56,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da4417c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:08:56, skipping insertion in model container [2024-10-14 07:08:56,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:56" (3/3) ... [2024-10-14 07:08:56,501 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2024-10-14 07:08:56,514 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:08:56,514 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:08:56,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:08:56,557 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;@1e046ad9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:08:56,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:08:56,562 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-14 07:08:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 07:08:56,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:56,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 07:08:56,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:56,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 07:08:56,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:08:56,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280947403] [2024-10-14 07:08:56,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:56,582 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-14 07:08:56,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:08:56,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:08:56,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:08:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:56,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 07:08:56,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:08:57,102 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-14 07:08:57,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:08:57,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:08:57,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280947403] [2024-10-14 07:08:57,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280947403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:57,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:57,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:08:57,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129467403] [2024-10-14 07:08:57,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:57,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:08:57,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:08:57,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:08:57,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:08:57,123 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-14 07:08:57,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:57,186 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-14 07:08:57,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:08:57,188 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-14 07:08:57,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:57,193 INFO L225 Difference]: With dead ends: 14 [2024-10-14 07:08:57,193 INFO L226 Difference]: Without dead ends: 8 [2024-10-14 07:08:57,195 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-14 07:08:57,198 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-14 07:08:57,199 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-14 07:08:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-14 07:08:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-14 07:08:57,217 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-14 07:08:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 07:08:57,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 07:08:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:57,219 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 07:08:57,219 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-14 07:08:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 07:08:57,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 07:08:57,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:57,220 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 07:08:57,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 07:08:57,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:08:57,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:57,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:57,425 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 07:08:57,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:08:57,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091798999] [2024-10-14 07:08:57,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:57,427 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-14 07:08:57,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:08:57,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:08:57,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 07:08:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:58,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-14 07:08:58,328 INFO L278 TraceCheckSpWp]: Computing forward predicates...