./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.h_b02.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:12:32,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:12:32,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:12:32,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:12:32,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:12:32,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:12:32,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:12:32,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:12:32,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:12:32,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:12:32,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:12:32,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:12:32,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:12:32,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:12:32,878 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:12:32,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:12:32,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:12:32,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:12:32,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:12:32,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:12:32,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:12:32,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:12:32,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:12:32,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:12:32,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:12:32,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:12:32,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:12:32,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:12:32,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:12:32,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:12:32,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:12:32,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:12:32,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:12:32,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:12:32,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:12:32,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:12:32,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:12:32,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:12:32,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:12:32,882 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b [2024-10-11 06:12:33,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:12:33,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:12:33,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:12:33,181 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:12:33,182 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:12:33,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2024-10-11 06:12:35,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:12:35,371 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:12:35,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2024-10-11 06:12:35,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3bb8af340/db2717a9fe0241178ca930a221612ee5/FLAG69a498d1e [2024-10-11 06:12:35,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3bb8af340/db2717a9fe0241178ca930a221612ee5 [2024-10-11 06:12:35,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:12:35,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:12:35,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:12:35,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:12:35,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:12:35,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:35,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156643ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35, skipping insertion in model container [2024-10-11 06:12:35,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:35,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:12:35,662 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.h_b02.c[1245,1258] [2024-10-11 06:12:35,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:12:35,827 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:12:35,851 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.h_b02.c[1245,1258] [2024-10-11 06:12:35,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:12:35,956 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:12:35,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35 WrapperNode [2024-10-11 06:12:35,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:12:35,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:12:35,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:12:35,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:12:35,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:35,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:36,042 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 507 [2024-10-11 06:12:36,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:12:36,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:12:36,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:12:36,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:12:36,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:36,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:36,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:36,106 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-11 06:12:36,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:36,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:36,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:36,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:36,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:36,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:36,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:12:36,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:12:36,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:12:36,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:12:36,163 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (1/1) ... [2024-10-11 06:12:36,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:12:36,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:36,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:12:36,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:12:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:12:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:12:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 06:12:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:12:36,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:12:36,388 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:12:36,391 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:12:37,154 INFO L? ?]: Removed 307 outVars from TransFormulas that were not future-live. [2024-10-11 06:12:37,155 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:12:37,227 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:12:37,228 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:12:37,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:37 BoogieIcfgContainer [2024-10-11 06:12:37,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:12:37,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:12:37,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:12:37,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:12:37,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:12:35" (1/3) ... [2024-10-11 06:12:37,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35df2ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:37, skipping insertion in model container [2024-10-11 06:12:37,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35" (2/3) ... [2024-10-11 06:12:37,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35df2ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:37, skipping insertion in model container [2024-10-11 06:12:37,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:37" (3/3) ... [2024-10-11 06:12:37,244 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b02.c [2024-10-11 06:12:37,263 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:12:37,263 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:12:37,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:12:37,324 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;@3550c2c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:12:37,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:12:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 114 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 06:12:37,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:37,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:37,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:37,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:37,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1288632119, now seen corresponding path program 1 times [2024-10-11 06:12:37,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:37,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811565822] [2024-10-11 06:12:37,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:37,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:37,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:37,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811565822] [2024-10-11 06:12:37,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811565822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:37,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:37,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:37,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677533116] [2024-10-11 06:12:37,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:37,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:12:37,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:38,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:12:38,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:38,027 INFO L87 Difference]: Start difference. First operand has 115 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 114 states have internal predecessors, (170), 0 states have call successors, (0), 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 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:38,090 INFO L93 Difference]: Finished difference Result 222 states and 330 transitions. [2024-10-11 06:12:38,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:12:38,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-11 06:12:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:38,105 INFO L225 Difference]: With dead ends: 222 [2024-10-11 06:12:38,106 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 06:12:38,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:38,114 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:38,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:38,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 06:12:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 06:12:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 115 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2024-10-11 06:12:38,158 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 18 [2024-10-11 06:12:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:38,159 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2024-10-11 06:12:38,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2024-10-11 06:12:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 06:12:38,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:38,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:38,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:12:38,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:38,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:38,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1291194781, now seen corresponding path program 1 times [2024-10-11 06:12:38,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:38,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270833342] [2024-10-11 06:12:38,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:38,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:38,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270833342] [2024-10-11 06:12:38,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270833342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:38,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:38,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:38,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619569176] [2024-10-11 06:12:38,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:38,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:12:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:38,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:12:38,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:38,335 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:38,369 INFO L93 Difference]: Finished difference Result 225 states and 330 transitions. [2024-10-11 06:12:38,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:12:38,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-11 06:12:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:38,374 INFO L225 Difference]: With dead ends: 225 [2024-10-11 06:12:38,374 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 06:12:38,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:38,376 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:38,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:38,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 06:12:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-11 06:12:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.4700854700854702) internal successors, (172), 117 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-10-11 06:12:38,383 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 19 [2024-10-11 06:12:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:38,384 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-10-11 06:12:38,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-10-11 06:12:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 06:12:38,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:38,385 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] [2024-10-11 06:12:38,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:12:38,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:38,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1824668898, now seen corresponding path program 1 times [2024-10-11 06:12:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:38,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448503618] [2024-10-11 06:12:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:38,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:38,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448503618] [2024-10-11 06:12:38,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448503618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:38,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:38,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:12:38,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425238230] [2024-10-11 06:12:38,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:38,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:12:38,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:38,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:12:38,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:12:38,888 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:39,014 INFO L93 Difference]: Finished difference Result 237 states and 346 transitions. [2024-10-11 06:12:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:12:39,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-11 06:12:39,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:39,017 INFO L225 Difference]: With dead ends: 237 [2024-10-11 06:12:39,018 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 06:12:39,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:12:39,019 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 181 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:39,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 944 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:12:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 06:12:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-10-11 06:12:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.4682539682539681) internal successors, (185), 126 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2024-10-11 06:12:39,041 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 20 [2024-10-11 06:12:39,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:39,041 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2024-10-11 06:12:39,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2024-10-11 06:12:39,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 06:12:39,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:39,048 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] [2024-10-11 06:12:39,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:12:39,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:39,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash -441218408, now seen corresponding path program 1 times [2024-10-11 06:12:39,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:39,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965033697] [2024-10-11 06:12:39,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:39,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:39,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:39,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965033697] [2024-10-11 06:12:39,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965033697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:39,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:39,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:12:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679217484] [2024-10-11 06:12:39,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:39,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:12:39,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:39,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:12:39,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:12:39,474 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:39,779 INFO L93 Difference]: Finished difference Result 315 states and 457 transitions. [2024-10-11 06:12:39,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:12:39,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-11 06:12:39,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:39,782 INFO L225 Difference]: With dead ends: 315 [2024-10-11 06:12:39,782 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 06:12:39,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:12:39,787 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 578 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:39,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 337 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:12:39,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 06:12:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 130. [2024-10-11 06:12:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.4651162790697674) internal successors, (189), 129 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 189 transitions. [2024-10-11 06:12:39,807 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 189 transitions. Word has length 21 [2024-10-11 06:12:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:39,807 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 189 transitions. [2024-10-11 06:12:39,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 189 transitions. [2024-10-11 06:12:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 06:12:39,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:39,808 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] [2024-10-11 06:12:39,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:12:39,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:39,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash -409776833, now seen corresponding path program 1 times [2024-10-11 06:12:39,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:39,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808468331] [2024-10-11 06:12:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:40,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:40,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808468331] [2024-10-11 06:12:40,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808468331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:40,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:40,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:40,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190691077] [2024-10-11 06:12:40,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:40,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:12:40,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:40,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:12:40,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:12:40,127 INFO L87 Difference]: Start difference. First operand 130 states and 189 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:40,160 INFO L93 Difference]: Finished difference Result 254 states and 371 transitions. [2024-10-11 06:12:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:40,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-11 06:12:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:40,162 INFO L225 Difference]: With dead ends: 254 [2024-10-11 06:12:40,162 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 06:12:40,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:12:40,166 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 163 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:40,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 480 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 06:12:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-11 06:12:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4592592592592593) internal successors, (197), 135 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 197 transitions. [2024-10-11 06:12:40,177 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 197 transitions. Word has length 22 [2024-10-11 06:12:40,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:40,178 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 197 transitions. [2024-10-11 06:12:40,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 197 transitions. [2024-10-11 06:12:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 06:12:40,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:40,178 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] [2024-10-11 06:12:40,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:12:40,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:40,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash 814043263, now seen corresponding path program 1 times [2024-10-11 06:12:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:40,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413924542] [2024-10-11 06:12:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:40,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:40,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:40,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413924542] [2024-10-11 06:12:40,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413924542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:40,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:40,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:40,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372649262] [2024-10-11 06:12:40,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:40,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:12:40,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:40,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:12:40,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:40,356 INFO L87 Difference]: Start difference. First operand 136 states and 197 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:40,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:40,374 INFO L93 Difference]: Finished difference Result 260 states and 377 transitions. [2024-10-11 06:12:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:12:40,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-11 06:12:40,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:40,376 INFO L225 Difference]: With dead ends: 260 [2024-10-11 06:12:40,376 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 06:12:40,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:40,379 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 6 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:40,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 475 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 06:12:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-11 06:12:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 135 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 193 transitions. [2024-10-11 06:12:40,393 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 193 transitions. Word has length 22 [2024-10-11 06:12:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:40,393 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 193 transitions. [2024-10-11 06:12:40,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 193 transitions. [2024-10-11 06:12:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 06:12:40,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:40,394 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] [2024-10-11 06:12:40,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:12:40,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:40,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:40,395 INFO L85 PathProgramCache]: Analyzing trace with hash -628383186, now seen corresponding path program 1 times [2024-10-11 06:12:40,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:40,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364064199] [2024-10-11 06:12:40,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:40,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:40,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:40,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364064199] [2024-10-11 06:12:40,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364064199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:40,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:40,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:40,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968266859] [2024-10-11 06:12:40,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:40,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:12:40,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:40,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:12:40,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:12:40,486 INFO L87 Difference]: Start difference. First operand 136 states and 193 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:40,569 INFO L93 Difference]: Finished difference Result 366 states and 519 transitions. [2024-10-11 06:12:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:40,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-11 06:12:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:40,570 INFO L225 Difference]: With dead ends: 366 [2024-10-11 06:12:40,571 INFO L226 Difference]: Without dead ends: 242 [2024-10-11 06:12:40,571 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-11 06:12:40,573 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 442 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:40,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 454 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:12:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-11 06:12:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 141. [2024-10-11 06:12:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 198 transitions. [2024-10-11 06:12:40,586 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 198 transitions. Word has length 23 [2024-10-11 06:12:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:40,587 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 198 transitions. [2024-10-11 06:12:40,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2024-10-11 06:12:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 06:12:40,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:40,588 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] [2024-10-11 06:12:40,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:12:40,588 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:40,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash 374424269, now seen corresponding path program 1 times [2024-10-11 06:12:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:40,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228064468] [2024-10-11 06:12:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:40,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:40,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:40,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228064468] [2024-10-11 06:12:40,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228064468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:40,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:40,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:40,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196564173] [2024-10-11 06:12:40,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:40,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:12:40,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:40,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:12:40,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:12:40,704 INFO L87 Difference]: Start difference. First operand 141 states and 198 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:40,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:40,749 INFO L93 Difference]: Finished difference Result 307 states and 432 transitions. [2024-10-11 06:12:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:40,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-11 06:12:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:40,751 INFO L225 Difference]: With dead ends: 307 [2024-10-11 06:12:40,751 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 06:12:40,751 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-11 06:12:40,753 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 286 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:40,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 478 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 06:12:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 137. [2024-10-11 06:12:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.4191176470588236) internal successors, (193), 136 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 193 transitions. [2024-10-11 06:12:40,761 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 193 transitions. Word has length 23 [2024-10-11 06:12:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:40,761 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 193 transitions. [2024-10-11 06:12:40,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 193 transitions. [2024-10-11 06:12:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 06:12:40,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:40,763 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:40,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 06:12:40,764 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:40,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash 430403142, now seen corresponding path program 1 times [2024-10-11 06:12:40,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:40,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523207704] [2024-10-11 06:12:40,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:40,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:44,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:44,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523207704] [2024-10-11 06:12:44,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523207704] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:12:44,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805053121] [2024-10-11 06:12:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:44,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:44,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:44,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:12:44,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 06:12:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:44,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-10-11 06:12:44,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:12:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:46,457 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:12:46,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805053121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:46,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 06:12:46,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 20 [2024-10-11 06:12:46,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008815095] [2024-10-11 06:12:46,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:46,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 06:12:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:46,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 06:12:46,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-10-11 06:12:46,460 INFO L87 Difference]: Start difference. First operand 137 states and 193 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:47,194 INFO L93 Difference]: Finished difference Result 360 states and 513 transitions. [2024-10-11 06:12:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 06:12:47,194 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-11 06:12:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:47,196 INFO L225 Difference]: With dead ends: 360 [2024-10-11 06:12:47,196 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 06:12:47,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2024-10-11 06:12:47,197 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 332 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:47,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 581 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 06:12:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 06:12:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 224. [2024-10-11 06:12:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.4170403587443947) internal successors, (316), 223 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 316 transitions. [2024-10-11 06:12:47,204 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 316 transitions. Word has length 76 [2024-10-11 06:12:47,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:47,205 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 316 transitions. [2024-10-11 06:12:47,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 316 transitions. [2024-10-11 06:12:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 06:12:47,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:47,210 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:47,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 06:12:47,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:47,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:47,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:47,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1360448397, now seen corresponding path program 1 times [2024-10-11 06:12:47,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:47,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600370058] [2024-10-11 06:12:47,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:47,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:48,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:48,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600370058] [2024-10-11 06:12:48,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600370058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:48,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:48,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:12:48,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798806271] [2024-10-11 06:12:48,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:48,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:12:48,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:48,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:12:48,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:12:48,616 INFO L87 Difference]: Start difference. First operand 224 states and 316 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:48,891 INFO L93 Difference]: Finished difference Result 374 states and 529 transitions. [2024-10-11 06:12:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:12:48,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-11 06:12:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:48,893 INFO L225 Difference]: With dead ends: 374 [2024-10-11 06:12:48,893 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 06:12:48,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:12:48,894 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 372 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:48,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 498 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:12:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 06:12:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 225. [2024-10-11 06:12:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.4107142857142858) internal successors, (316), 224 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2024-10-11 06:12:48,905 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 77 [2024-10-11 06:12:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:48,906 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2024-10-11 06:12:48,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2024-10-11 06:12:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 06:12:48,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:48,907 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:48,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 06:12:48,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:48,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1476307721, now seen corresponding path program 1 times [2024-10-11 06:12:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:48,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357731330] [2024-10-11 06:12:48,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:48,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:51,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:51,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357731330] [2024-10-11 06:12:51,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357731330] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:12:51,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331157897] [2024-10-11 06:12:51,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:51,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:51,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:51,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:12:51,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 06:12:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:51,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-10-11 06:12:51,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:12:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:52,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:12:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:54,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331157897] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:12:54,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:12:54,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 19] total 39 [2024-10-11 06:12:54,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666772088] [2024-10-11 06:12:54,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:12:54,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 06:12:54,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:54,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 06:12:54,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1356, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 06:12:54,252 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand has 40 states, 40 states have (on average 5.475) internal successors, (219), 39 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:56,400 INFO L93 Difference]: Finished difference Result 553 states and 783 transitions. [2024-10-11 06:12:56,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-11 06:12:56,402 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 5.475) internal successors, (219), 39 states have internal predecessors, (219), 0 states have call successors, (0), 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 78 [2024-10-11 06:12:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:56,404 INFO L225 Difference]: With dead ends: 553 [2024-10-11 06:12:56,404 INFO L226 Difference]: Without dead ends: 429 [2024-10-11 06:12:56,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=710, Invalid=4692, Unknown=0, NotChecked=0, Total=5402 [2024-10-11 06:12:56,408 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 2779 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2779 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:56,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2779 Valid, 2048 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 06:12:56,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-11 06:12:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 388. [2024-10-11 06:12:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.4186046511627908) internal successors, (549), 387 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 549 transitions. [2024-10-11 06:12:56,417 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 549 transitions. Word has length 78 [2024-10-11 06:12:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:56,418 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 549 transitions. [2024-10-11 06:12:56,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.475) internal successors, (219), 39 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 549 transitions. [2024-10-11 06:12:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 06:12:56,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:56,421 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:56,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 06:12:56,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:56,626 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:56,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:56,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1672691683, now seen corresponding path program 1 times [2024-10-11 06:12:56,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:56,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447875954] [2024-10-11 06:12:56,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:56,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:57,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:57,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447875954] [2024-10-11 06:12:57,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447875954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:57,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:57,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:12:57,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324839462] [2024-10-11 06:12:57,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:57,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:12:57,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:57,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:12:57,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:12:57,452 INFO L87 Difference]: Start difference. First operand 388 states and 549 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:57,590 INFO L93 Difference]: Finished difference Result 750 states and 1067 transitions. [2024-10-11 06:12:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:12:57,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-11 06:12:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:57,593 INFO L225 Difference]: With dead ends: 750 [2024-10-11 06:12:57,593 INFO L226 Difference]: Without dead ends: 403 [2024-10-11 06:12:57,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:12:57,594 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 147 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:57,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 672 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:12:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-11 06:12:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2024-10-11 06:12:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 1.4104477611940298) internal successors, (567), 402 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 567 transitions. [2024-10-11 06:12:57,604 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 567 transitions. Word has length 79 [2024-10-11 06:12:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:57,604 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 567 transitions. [2024-10-11 06:12:57,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 567 transitions. [2024-10-11 06:12:57,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 06:12:57,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:57,607 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:57,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 06:12:57,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:57,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:57,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1409078887, now seen corresponding path program 1 times [2024-10-11 06:12:57,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:57,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895431229] [2024-10-11 06:12:57,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:57,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 06:12:59,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:59,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895431229] [2024-10-11 06:12:59,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895431229] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:12:59,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505773020] [2024-10-11 06:12:59,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:59,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:59,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:59,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:12:59,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 06:12:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:59,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 06:12:59,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:13:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:13:00,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:13:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:13:00,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505773020] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:13:00,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:13:00,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2024-10-11 06:13:00,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737786986] [2024-10-11 06:13:00,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:13:00,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 06:13:00,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:13:00,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 06:13:00,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-10-11 06:13:00,885 INFO L87 Difference]: Start difference. First operand 403 states and 567 transitions. Second operand has 20 states, 20 states have (on average 11.0) internal successors, (220), 19 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:13:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:13:01,845 INFO L93 Difference]: Finished difference Result 743 states and 1053 transitions. [2024-10-11 06:13:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 06:13:01,845 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.0) internal successors, (220), 19 states have internal predecessors, (220), 0 states have call successors, (0), 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 79 [2024-10-11 06:13:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:13:01,848 INFO L225 Difference]: With dead ends: 743 [2024-10-11 06:13:01,848 INFO L226 Difference]: Without dead ends: 501 [2024-10-11 06:13:01,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 06:13:01,849 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 306 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 06:13:01,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 828 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 06:13:01,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-11 06:13:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 407. [2024-10-11 06:13:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.4064039408866995) internal successors, (571), 406 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:13:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 571 transitions. [2024-10-11 06:13:01,858 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 571 transitions. Word has length 79 [2024-10-11 06:13:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:13:01,858 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 571 transitions. [2024-10-11 06:13:01,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.0) internal successors, (220), 19 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:13:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 571 transitions. [2024-10-11 06:13:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 06:13:01,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:13:01,860 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:13:01,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 06:13:02,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:13:02,065 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:13:02,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:13:02,066 INFO L85 PathProgramCache]: Analyzing trace with hash -104607216, now seen corresponding path program 1 times [2024-10-11 06:13:02,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:13:02,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373344973] [2024-10-11 06:13:02,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:13:02,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:13:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:13:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:13:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:13:02,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373344973] [2024-10-11 06:13:02,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373344973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:13:02,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:13:02,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:13:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167044662] [2024-10-11 06:13:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:13:02,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:13:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:13:02,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:13:02,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:13:02,312 INFO L87 Difference]: Start difference. First operand 407 states and 571 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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-11 06:13:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:13:02,345 INFO L93 Difference]: Finished difference Result 826 states and 1163 transitions. [2024-10-11 06:13:02,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:13:02,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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-11 06:13:02,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:13:02,347 INFO L225 Difference]: With dead ends: 826 [2024-10-11 06:13:02,347 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 06:13:02,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:13:02,348 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 16 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:13:02,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 635 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:13:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 06:13:02,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 443. [2024-10-11 06:13:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.4004524886877827) internal successors, (619), 442 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:13:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 619 transitions. [2024-10-11 06:13:02,357 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 619 transitions. Word has length 80 [2024-10-11 06:13:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:13:02,357 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 619 transitions. [2024-10-11 06:13:02,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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-11 06:13:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 619 transitions. [2024-10-11 06:13:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 06:13:02,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:13:02,358 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:13:02,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 06:13:02,358 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:13:02,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:13:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash 578979863, now seen corresponding path program 1 times [2024-10-11 06:13:02,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:13:02,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456467611] [2024-10-11 06:13:02,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:13:02,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:13:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:13:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:13:02,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:13:02,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456467611] [2024-10-11 06:13:02,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456467611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:13:02,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:13:02,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:13:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437504786] [2024-10-11 06:13:02,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:13:02,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:13:02,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:13:02,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:13:02,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:13:02,909 INFO L87 Difference]: Start difference. First operand 443 states and 619 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 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-11 06:13:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:13:02,955 INFO L93 Difference]: Finished difference Result 857 states and 1204 transitions. [2024-10-11 06:13:02,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:13:02,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 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-11 06:13:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:13:02,958 INFO L225 Difference]: With dead ends: 857 [2024-10-11 06:13:02,958 INFO L226 Difference]: Without dead ends: 467 [2024-10-11 06:13:02,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:13:02,960 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 148 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:13:02,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 597 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:13:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-11 06:13:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 461. [2024-10-11 06:13:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.3978260869565218) internal successors, (643), 460 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:13:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 643 transitions. [2024-10-11 06:13:02,970 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 643 transitions. Word has length 80 [2024-10-11 06:13:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:13:02,970 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 643 transitions. [2024-10-11 06:13:02,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 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-11 06:13:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 643 transitions. [2024-10-11 06:13:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 06:13:02,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:13:02,972 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:13:02,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 06:13:02,972 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:13:02,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:13:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1235624151, now seen corresponding path program 1 times [2024-10-11 06:13:02,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:13:02,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766584716] [2024-10-11 06:13:02,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:13:02,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:13:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:13:03,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:13:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:13:03,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:13:03,929 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:13:03,930 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:13:03,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 06:13:03,935 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:13:04,019 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:13:04,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:13:04 BoogieIcfgContainer [2024-10-11 06:13:04,025 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:13:04,025 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:13:04,025 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:13:04,026 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:13:04,026 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:37" (3/4) ... [2024-10-11 06:13:04,031 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:13:04,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:13:04,032 INFO L158 Benchmark]: Toolchain (without parser) took 28619.61ms. Allocated memory was 182.5MB in the beginning and 861.9MB in the end (delta: 679.5MB). Free memory was 151.5MB in the beginning and 469.2MB in the end (delta: -317.7MB). Peak memory consumption was 361.0MB. Max. memory is 16.1GB. [2024-10-11 06:13:04,033 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 87.5MB in the beginning and 87.3MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:13:04,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.84ms. Allocated memory is still 182.5MB. Free memory was 150.7MB in the beginning and 130.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 06:13:04,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.84ms. Allocated memory is still 182.5MB. Free memory was 130.8MB in the beginning and 118.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 06:13:04,033 INFO L158 Benchmark]: Boogie Preprocessor took 116.71ms. Allocated memory is still 182.5MB. Free memory was 118.2MB in the beginning and 110.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 06:13:04,033 INFO L158 Benchmark]: RCFGBuilder took 1067.01ms. Allocated memory is still 182.5MB. Free memory was 110.9MB in the beginning and 137.8MB in the end (delta: -26.9MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-10-11 06:13:04,034 INFO L158 Benchmark]: TraceAbstraction took 26795.26ms. Allocated memory was 182.5MB in the beginning and 861.9MB in the end (delta: 679.5MB). Free memory was 136.7MB in the beginning and 469.2MB in the end (delta: -332.5MB). Peak memory consumption was 347.0MB. Max. memory is 16.1GB. [2024-10-11 06:13:04,034 INFO L158 Benchmark]: Witness Printer took 6.72ms. Allocated memory is still 861.9MB. Free memory is still 469.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:13:04,035 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.17ms. Allocated memory is still 125.8MB. Free memory was 87.5MB in the beginning and 87.3MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.84ms. Allocated memory is still 182.5MB. Free memory was 150.7MB in the beginning and 130.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.84ms. Allocated memory is still 182.5MB. Free memory was 130.8MB in the beginning and 118.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.71ms. Allocated memory is still 182.5MB. Free memory was 118.2MB in the beginning and 110.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1067.01ms. Allocated memory is still 182.5MB. Free memory was 110.9MB in the beginning and 137.8MB in the end (delta: -26.9MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 26795.26ms. Allocated memory was 182.5MB in the beginning and 861.9MB in the end (delta: 679.5MB). Free memory was 136.7MB in the beginning and 469.2MB in the end (delta: -332.5MB). Peak memory consumption was 347.0MB. Max. memory is 16.1GB. * Witness Printer took 6.72ms. Allocated memory is still 861.9MB. Free memory is still 469.2MB. 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 88, overapproximation of bitwiseAnd at line 93. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 32); [L30] const SORT_7 msb_SORT_7 = (SORT_7)1 << (32 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 3); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (3 - 1); [L35] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 2); [L36] const SORT_47 msb_SORT_47 = (SORT_47)1 << (2 - 1); [L38] const SORT_1 var_4 = 0; [L39] const SORT_7 var_9 = 1; [L40] const SORT_12 var_13 = 0; [L41] const SORT_1 var_21 = 1; [L42] const SORT_12 var_28 = 2; [L43] const SORT_12 var_31 = 1; [L44] const SORT_12 var_35 = 4; [L45] const SORT_12 var_38 = 6; [L46] const SORT_12 var_41 = 5; [L47] const SORT_12 var_45 = 3; [L48] const SORT_7 var_57 = 0; [L50] SORT_1 input_2; [L51] SORT_1 input_3; [L52] SORT_12 input_55; [L53] SORT_12 input_62; [L54] SORT_12 input_75; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L56] SORT_1 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L57] SORT_12 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_12; [L59] SORT_1 init_6_arg_1 = var_4; [L60] state_5 = init_6_arg_1 [L61] SORT_12 init_15_arg_1 = var_13; [L62] state_14 = init_15_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] input_3 = __VERIFIER_nondet_uchar() [L67] input_55 = __VERIFIER_nondet_uchar() [L68] input_62 = __VERIFIER_nondet_uchar() [L69] input_75 = __VERIFIER_nondet_uchar() [L72] SORT_1 var_8_arg_0 = state_5; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_8_arg_0=0, var_9=1] [L73] EXPR var_8_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L73] var_8_arg_0 = var_8_arg_0 & mask_SORT_1 [L74] SORT_7 var_8 = var_8_arg_0; [L75] SORT_7 var_10_arg_0 = var_8; [L76] SORT_7 var_10_arg_1 = var_9; [L77] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L78] SORT_1 var_11_arg_0 = var_10; [L79] SORT_1 var_11 = ~var_11_arg_0; [L80] SORT_12 var_16_arg_0 = state_14; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_11=-1, var_13=0, var_16_arg_0=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] EXPR var_16_arg_0 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_11=-1, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] var_16_arg_0 = var_16_arg_0 & mask_SORT_12 [L82] SORT_7 var_16 = var_16_arg_0; [L83] SORT_7 var_17_arg_0 = var_16; [L84] SORT_7 var_17_arg_1 = var_9; [L85] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L86] SORT_1 var_18_arg_0 = var_11; [L87] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_18_arg_0=-1, var_18_arg_1=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L89] SORT_1 var_22_arg_0 = var_18; [L90] SORT_1 var_22 = ~var_22_arg_0; [L91] SORT_1 var_23_arg_0 = var_21; [L92] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-256, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L94] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 bad_24_arg_0 = var_23; [L96] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND FALSE !(!(cond)) [L96] RET __VERIFIER_assert(!(bad_24_arg_0)) [L98] SORT_12 var_42_arg_0 = state_14; [L99] SORT_12 var_42_arg_1 = var_41; [L100] SORT_1 var_42 = var_42_arg_0 == var_42_arg_1; [L101] SORT_12 var_39_arg_0 = state_14; [L102] SORT_12 var_39_arg_1 = var_38; [L103] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L104] SORT_1 var_43_arg_0 = var_42; [L105] SORT_1 var_43_arg_1 = var_39; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_43_arg_0=0, var_43_arg_1=0, var_45=3, var_4=0, var_57=0, var_9=1] [L106] EXPR var_43_arg_0 | var_43_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L106] SORT_1 var_43 = var_43_arg_0 | var_43_arg_1; [L107] EXPR var_43 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L107] var_43 = var_43 & mask_SORT_1 [L108] SORT_12 var_36_arg_0 = state_14; [L109] SORT_12 var_36_arg_1 = var_35; [L110] SORT_1 var_36 = var_36_arg_0 == var_36_arg_1; [L111] SORT_12 var_46_arg_0 = state_14; [L112] SORT_12 var_46_arg_1 = var_45; [L113] SORT_1 var_46 = var_46_arg_0 == var_46_arg_1; [L114] SORT_1 var_48_arg_0 = var_36; [L115] SORT_1 var_48_arg_1 = var_46; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_48_arg_0=0, var_48_arg_1=0, var_4=0, var_57=0, var_9=1] [L116] EXPR ((SORT_47)var_48_arg_0 << 1) | var_48_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L116] SORT_47 var_48 = ((SORT_47)var_48_arg_0 << 1) | var_48_arg_1; [L117] EXPR var_48 & mask_SORT_47 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L117] var_48 = var_48 & mask_SORT_47 [L118] SORT_1 var_49_arg_0 = var_43; [L119] SORT_47 var_49_arg_1 = var_48; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_49_arg_0=0, var_49_arg_1=0, var_4=0, var_57=0, var_9=1] [L120] EXPR ((SORT_12)var_49_arg_0 << 2) | var_49_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L120] SORT_12 var_49 = ((SORT_12)var_49_arg_0 << 2) | var_49_arg_1; [L121] EXPR var_49 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L121] var_49 = var_49 & mask_SORT_12 [L122] SORT_12 var_50_arg_0 = var_49; [L123] SORT_1 var_50 = var_50_arg_0 != 0; [L124] SORT_1 var_40_arg_0 = var_39; [L125] SORT_1 var_40_arg_1 = var_4; [L126] SORT_1 var_40_arg_2 = var_4; [L127] SORT_1 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; [L128] SORT_1 var_37_arg_0 = var_36; [L129] SORT_1 var_37_arg_1 = var_21; [L130] SORT_1 var_37_arg_2 = var_4; [L131] SORT_1 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L132] SORT_1 var_44_arg_0 = var_43; [L133] SORT_1 var_44_arg_1 = var_40; [L134] SORT_1 var_44_arg_2 = var_37; [L135] SORT_1 var_44 = var_44_arg_0 ? var_44_arg_1 : var_44_arg_2; [L136] SORT_12 var_32_arg_0 = state_14; [L137] SORT_12 var_32_arg_1 = var_31; [L138] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L139] SORT_12 var_29_arg_0 = state_14; [L140] SORT_12 var_29_arg_1 = var_28; [L141] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L142] SORT_1 var_33_arg_0 = var_32; [L143] SORT_1 var_33_arg_1 = var_29; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_33_arg_0=0, var_33_arg_1=0, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L144] EXPR var_33_arg_0 | var_33_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L144] SORT_1 var_33 = var_33_arg_0 | var_33_arg_1; [L145] EXPR var_33 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L145] var_33 = var_33 & mask_SORT_1 [L146] SORT_1 var_30_arg_0 = var_29; [L147] SORT_1 var_30_arg_1 = var_4; [L148] SORT_1 var_30_arg_2 = var_4; [L149] SORT_1 var_30 = var_30_arg_0 ? var_30_arg_1 : var_30_arg_2; [L150] SORT_12 var_26_arg_0 = state_14; [L151] SORT_12 var_26_arg_1 = var_13; [L152] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L153] SORT_1 var_27_arg_0 = var_26; [L154] SORT_1 var_27_arg_1 = var_4; [L155] SORT_1 var_27_arg_2 = state_5; [L156] SORT_1 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L157] SORT_1 var_34_arg_0 = var_33; [L158] SORT_1 var_34_arg_1 = var_30; [L159] SORT_1 var_34_arg_2 = var_27; [L160] SORT_1 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L161] SORT_1 var_51_arg_0 = var_50; [L162] SORT_1 var_51_arg_1 = var_44; [L163] SORT_1 var_51_arg_2 = var_34; [L164] SORT_1 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L165] SORT_1 next_52_arg_1 = var_51; [L166] SORT_12 var_83_arg_0 = state_14; [L167] SORT_12 var_83_arg_1 = var_41; [L168] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L169] SORT_12 var_81_arg_0 = state_14; [L170] SORT_12 var_81_arg_1 = var_38; [L171] SORT_1 var_81 = var_81_arg_0 == var_81_arg_1; [L172] SORT_1 var_84_arg_0 = var_83; [L173] SORT_1 var_84_arg_1 = var_81; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_84_arg_0=0, var_84_arg_1=0, var_9=1] [L174] EXPR var_84_arg_0 | var_84_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_9=1] [L174] SORT_1 var_84 = var_84_arg_0 | var_84_arg_1; [L175] EXPR var_84 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_9=1] [L175] var_84 = var_84 & mask_SORT_1 [L176] SORT_12 var_73_arg_0 = state_14; [L177] SORT_12 var_73_arg_1 = var_35; [L178] SORT_1 var_73 = var_73_arg_0 == var_73_arg_1; [L179] SORT_12 var_86_arg_0 = state_14; [L180] SORT_12 var_86_arg_1 = var_45; [L181] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L182] SORT_1 var_87_arg_0 = var_73; [L183] SORT_1 var_87_arg_1 = var_86; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_87_arg_0=0, var_87_arg_1=0, var_9=1] [L184] EXPR ((SORT_47)var_87_arg_0 << 1) | var_87_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L184] SORT_47 var_87 = ((SORT_47)var_87_arg_0 << 1) | var_87_arg_1; [L185] EXPR var_87 & mask_SORT_47 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L185] var_87 = var_87 & mask_SORT_47 [L186] SORT_1 var_88_arg_0 = var_84; [L187] SORT_47 var_88_arg_1 = var_87; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_88_arg_0=0, var_88_arg_1=0, var_9=1] [L188] EXPR ((SORT_12)var_88_arg_0 << 2) | var_88_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L188] SORT_12 var_88 = ((SORT_12)var_88_arg_0 << 2) | var_88_arg_1; [L189] EXPR var_88 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L189] var_88 = var_88 & mask_SORT_12 [L190] SORT_12 var_89_arg_0 = var_88; [L191] SORT_1 var_89 = var_89_arg_0 != 0; [L192] SORT_12 var_79_arg_0 = state_14; [L193] SORT_12 var_79_arg_1 = var_38; [L194] SORT_1 var_79 = var_79_arg_0 == var_79_arg_1; [L195] SORT_1 var_76_arg_0 = input_2; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_76_arg_0=0, var_79=0, var_81=0, var_84=0, var_89=0, var_9=1] [L196] EXPR var_76_arg_0 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_79=0, var_81=0, var_84=0, var_89=0, var_9=1] [L196] var_76_arg_0 = var_76_arg_0 & mask_SORT_1 [L197] SORT_7 var_76 = var_76_arg_0; [L198] SORT_7 var_77_arg_0 = var_76; [L199] SORT_7 var_77_arg_1 = var_57; [L200] SORT_1 var_77 = var_77_arg_0 == var_77_arg_1; [L201] SORT_1 var_78_arg_0 = var_77; [L202] SORT_12 var_78_arg_1 = var_35; [L203] SORT_12 var_78_arg_2 = var_13; [L204] SORT_12 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_80_arg_0 = var_79; [L206] SORT_12 var_80_arg_1 = var_78; [L207] SORT_12 var_80_arg_2 = input_75; [L208] SORT_12 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L209] SORT_1 var_82_arg_0 = var_81; [L210] SORT_12 var_82_arg_1 = var_80; [L211] SORT_12 var_82_arg_2 = var_38; [L212] SORT_12 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L213] SORT_1 var_74_arg_0 = var_73; [L214] SORT_12 var_74_arg_1 = var_31; [L215] SORT_12 var_74_arg_2 = var_35; [L216] SORT_12 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L217] SORT_1 var_85_arg_0 = var_84; [L218] SORT_12 var_85_arg_1 = var_82; [L219] SORT_12 var_85_arg_2 = var_74; [L220] SORT_12 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L221] SORT_12 var_70_arg_0 = state_14; [L222] SORT_12 var_70_arg_1 = var_31; [L223] SORT_1 var_70 = var_70_arg_0 == var_70_arg_1; [L224] SORT_12 var_68_arg_0 = state_14; [L225] SORT_12 var_68_arg_1 = var_28; [L226] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L227] SORT_1 var_71_arg_0 = var_70; [L228] SORT_1 var_71_arg_1 = var_68; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_71_arg_0=0, var_71_arg_1=0, var_85=4, var_89=0, var_9=1] [L229] EXPR var_71_arg_0 | var_71_arg_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_85=4, var_89=0, var_9=1] [L229] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L230] EXPR var_71 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_85=4, var_89=0, var_9=1] [L230] var_71 = var_71 & mask_SORT_1 [L231] SORT_12 var_66_arg_0 = state_14; [L232] SORT_12 var_66_arg_1 = var_28; [L233] SORT_1 var_66 = var_66_arg_0 == var_66_arg_1; [L234] SORT_1 var_63_arg_0 = input_2; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_63_arg_0=0, var_66=0, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L235] EXPR var_63_arg_0 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_66=0, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L235] var_63_arg_0 = var_63_arg_0 & mask_SORT_1 [L236] SORT_7 var_63 = var_63_arg_0; [L237] SORT_7 var_64_arg_0 = var_63; [L238] SORT_7 var_64_arg_1 = var_57; [L239] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L240] SORT_1 var_65_arg_0 = var_64; [L241] SORT_12 var_65_arg_1 = var_45; [L242] SORT_12 var_65_arg_2 = var_38; [L243] SORT_12 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L244] SORT_1 var_67_arg_0 = var_66; [L245] SORT_12 var_67_arg_1 = var_65; [L246] SORT_12 var_67_arg_2 = input_62; [L247] SORT_12 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L248] SORT_12 var_60_arg_0 = state_14; [L249] SORT_12 var_60_arg_1 = var_31; [L250] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L251] SORT_1 var_56_arg_0 = input_2; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_56_arg_0=0, var_57=0, var_60=0, var_67=1, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L252] EXPR var_56_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_60=0, var_67=1, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L252] var_56_arg_0 = var_56_arg_0 & mask_SORT_1 [L253] SORT_7 var_56 = var_56_arg_0; [L254] SORT_7 var_58_arg_0 = var_56; [L255] SORT_7 var_58_arg_1 = var_57; [L256] SORT_1 var_58 = var_58_arg_0 == var_58_arg_1; [L257] SORT_1 var_59_arg_0 = var_58; [L258] SORT_12 var_59_arg_1 = var_28; [L259] SORT_12 var_59_arg_2 = var_41; [L260] SORT_12 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L261] SORT_1 var_61_arg_0 = var_60; [L262] SORT_12 var_61_arg_1 = var_59; [L263] SORT_12 var_61_arg_2 = input_55; [L264] SORT_12 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L265] SORT_1 var_69_arg_0 = var_68; [L266] SORT_12 var_69_arg_1 = var_67; [L267] SORT_12 var_69_arg_2 = var_61; [L268] SORT_12 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L269] SORT_12 var_53_arg_0 = state_14; [L270] SORT_12 var_53_arg_1 = var_13; [L271] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L272] SORT_1 var_54_arg_0 = var_53; [L273] SORT_12 var_54_arg_1 = var_31; [L274] SORT_12 var_54_arg_2 = state_14; [L275] SORT_12 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L276] SORT_1 var_72_arg_0 = var_71; [L277] SORT_12 var_72_arg_1 = var_69; [L278] SORT_12 var_72_arg_2 = var_54; [L279] SORT_12 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L280] SORT_1 var_90_arg_0 = var_89; [L281] SORT_12 var_90_arg_1 = var_85; [L282] SORT_12 var_90_arg_2 = var_72; [L283] SORT_12 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_90=1, var_9=1] [L284] EXPR var_90 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L284] var_90 = var_90 & mask_SORT_12 [L285] SORT_12 next_91_arg_1 = var_90; [L287] state_5 = next_52_arg_1 [L288] state_14 = next_91_arg_1 [L65] input_2 = __VERIFIER_nondet_uchar() [L66] input_3 = __VERIFIER_nondet_uchar() [L67] input_55 = __VERIFIER_nondet_uchar() [L68] input_62 = __VERIFIER_nondet_uchar() [L69] input_75 = __VERIFIER_nondet_uchar() [L72] SORT_1 var_8_arg_0 = state_5; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_8_arg_0=0, var_9=1] [L73] EXPR var_8_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L73] var_8_arg_0 = var_8_arg_0 & mask_SORT_1 [L74] SORT_7 var_8 = var_8_arg_0; [L75] SORT_7 var_10_arg_0 = var_8; [L76] SORT_7 var_10_arg_1 = var_9; [L77] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L78] SORT_1 var_11_arg_0 = var_10; [L79] SORT_1 var_11 = ~var_11_arg_0; [L80] SORT_12 var_16_arg_0 = state_14; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_11=-1, var_13=0, var_16_arg_0=1, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] EXPR var_16_arg_0 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_11=-1, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] var_16_arg_0 = var_16_arg_0 & mask_SORT_12 [L82] SORT_7 var_16 = var_16_arg_0; [L83] SORT_7 var_17_arg_0 = var_16; [L84] SORT_7 var_17_arg_1 = var_9; [L85] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L86] SORT_1 var_18_arg_0 = var_11; [L87] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_18_arg_0=-1, var_18_arg_1=1, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L89] SORT_1 var_22_arg_0 = var_18; [L90] SORT_1 var_22 = ~var_22_arg_0; [L91] SORT_1 var_23_arg_0 = var_21; [L92] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L94] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 bad_24_arg_0 = var_23; [L96] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.6s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5756 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5756 mSDsluCounter, 10004 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7970 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4382 IncrementalHoareTripleChecker+Invalid, 4432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 2034 mSDtfsCounter, 4382 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 558 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=15, InterpolantAutomatonStates: 134, 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, 15 MinimizatonAttempts, 395 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 1031 NumberOfCodeBlocks, 1031 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1087 ConstructedInterpolants, 0 QuantifiedInterpolants, 9697 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2019 ConjunctsInSsa, 240 ConjunctsInUnsatCore, 20 InterpolantComputations, 13 PerfectInterpolantSequences, 129/156 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 06:13:04,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:13:06,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:13:06,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 06:13:06,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:13:06,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:13:06,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:13:06,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:13:06,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:13:06,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:13:06,770 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:13:06,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:13:06,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:13:06,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:13:06,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:13:06,776 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:13:06,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:13:06,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:13:06,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:13:06,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:13:06,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:13:06,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:13:06,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:13:06,780 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:13:06,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:13:06,781 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:13:06,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:13:06,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:13:06,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:13:06,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:13:06,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:13:06,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:13:06,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:13:06,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:13:06,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:13:06,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:13:06,783 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:13:06,783 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:13:06,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:13:06,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:13:06,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:13:06,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:13:06,786 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:13:06,786 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b [2024-10-11 06:13:07,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:13:07,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:13:07,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:13:07,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:13:07,157 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:13:07,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2024-10-11 06:13:08,945 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:13:09,210 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:13:09,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2024-10-11 06:13:09,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4ae30e52b/22473d24f61a4cad91bc81478744a3d2/FLAG80d551333 [2024-10-11 06:13:09,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4ae30e52b/22473d24f61a4cad91bc81478744a3d2 [2024-10-11 06:13:09,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:13:09,252 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:13:09,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:13:09,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:13:09,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:13:09,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d4c565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09, skipping insertion in model container [2024-10-11 06:13:09,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:13:09,446 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.h_b02.c[1245,1258] [2024-10-11 06:13:09,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:13:09,556 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:13:09,569 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.h_b02.c[1245,1258] [2024-10-11 06:13:09,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:13:09,627 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:13:09,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09 WrapperNode [2024-10-11 06:13:09,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:13:09,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:13:09,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:13:09,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:13:09,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,713 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 291 [2024-10-11 06:13:09,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:13:09,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:13:09,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:13:09,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:13:09,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,759 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-11 06:13:09,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:13:09,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:13:09,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:13:09,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:13:09,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (1/1) ... [2024-10-11 06:13:09,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:13:09,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:13:09,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:13:09,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:13:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:13:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:13:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 06:13:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:13:09,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:13:09,984 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:13:09,987 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:13:10,371 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-11 06:13:10,371 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:13:10,406 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:13:10,407 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:13:10,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:10 BoogieIcfgContainer [2024-10-11 06:13:10,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:13:10,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:13:10,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:13:10,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:13:10,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:13:09" (1/3) ... [2024-10-11 06:13:10,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a49304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:13:10, skipping insertion in model container [2024-10-11 06:13:10,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:09" (2/3) ... [2024-10-11 06:13:10,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a49304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:13:10, skipping insertion in model container [2024-10-11 06:13:10,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:10" (3/3) ... [2024-10-11 06:13:10,417 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b02.c [2024-10-11 06:13:10,432 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:13:10,432 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:13:10,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:13:10,495 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;@3cc8ab93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:13:10,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:13:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:13:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:13:10,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:13:10,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:13:10,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:13:10,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:13:10,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:13:10,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:13:10,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581192699] [2024-10-11 06:13:10,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:13:10,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:13:10,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:13:10,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:13:10,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 06:13:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:13:10,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 06:13:10,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:13:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:13:10,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:13:10,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:13:10,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581192699] [2024-10-11 06:13:10,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581192699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:13:10,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:13:10,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:13:10,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74367662] [2024-10-11 06:13:10,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:13:10,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:13:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:13:10,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:13:10,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:13:10,849 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:13:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:13:10,906 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 06:13:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:13:10,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 06:13:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:13:10,916 INFO L225 Difference]: With dead ends: 15 [2024-10-11 06:13:10,917 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 06:13:10,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:13:10,925 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:13:10,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:13:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 06:13:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 06:13:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:13:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 06:13:10,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 06:13:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:13:10,958 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 06:13:10,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:13:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 06:13:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 06:13:10,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:13:10,960 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 06:13:10,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 06:13:11,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:13:11,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:13:11,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:13:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 06:13:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:13:11,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145278561] [2024-10-11 06:13:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:13:11,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:13:11,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:13:11,168 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:13:11,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 06:13:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:13:11,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 06:13:11,315 INFO L278 TraceCheckSpWp]: Computing forward predicates...