./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 05:16:34,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 05:16:34,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-22 05:16:34,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 05:16:34,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 05:16:34,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 05:16:34,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 05:16:34,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 05:16:34,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 05:16:34,199 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 05:16:34,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 05:16:34,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 05:16:34,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 05:16:34,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 05:16:34,200 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 05:16:34,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 05:16:34,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 05:16:34,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 05:16:34,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 05:16:34,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 05:16:34,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 05:16:34,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 05:16:34,203 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 05:16:34,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 05:16:34,203 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 05:16:34,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 05:16:34,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 05:16:34,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 05:16:34,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 05:16:34,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:16:34,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 05:16:34,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 05:16:34,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 05:16:34,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 05:16:34,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 05:16:34,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 05:16:34,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 05:16:34,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 05:16:34,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 05:16:34,207 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 [2024-11-22 05:16:34,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 05:16:34,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 05:16:34,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 05:16:34,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 05:16:34,427 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 05:16:34,428 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-11-22 05:16:35,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 05:16:36,054 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 05:16:36,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-11-22 05:16:36,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fffb509/958c3fdaa18b45d29f152a885b7b4a82/FLAGbc8bcdda4 [2024-11-22 05:16:36,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fffb509/958c3fdaa18b45d29f152a885b7b4a82 [2024-11-22 05:16:36,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 05:16:36,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 05:16:36,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 05:16:36,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 05:16:36,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 05:16:36,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@80ce2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36, skipping insertion in model container [2024-11-22 05:16:36,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 05:16:36,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2024-11-22 05:16:36,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:16:36,731 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 05:16:36,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2024-11-22 05:16:36,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:16:36,794 INFO L204 MainTranslator]: Completed translation [2024-11-22 05:16:36,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36 WrapperNode [2024-11-22 05:16:36,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 05:16:36,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 05:16:36,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 05:16:36,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 05:16:36,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,886 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 308 [2024-11-22 05:16:36,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 05:16:36,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 05:16:36,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 05:16:36,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 05:16:36,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,943 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 05:16:36,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 05:16:36,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 05:16:36,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 05:16:36,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 05:16:36,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (1/1) ... [2024-11-22 05:16:36,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:16:37,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:16:37,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 05:16:37,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 05:16:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 05:16:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 05:16:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 05:16:37,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 05:16:37,235 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 05:16:37,237 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 05:16:37,713 INFO L? ?]: Removed 175 outVars from TransFormulas that were not future-live. [2024-11-22 05:16:37,713 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 05:16:37,731 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 05:16:37,732 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 05:16:37,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:16:37 BoogieIcfgContainer [2024-11-22 05:16:37,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 05:16:37,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 05:16:37,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 05:16:37,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 05:16:37,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:16:36" (1/3) ... [2024-11-22 05:16:37,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e63ef2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:16:37, skipping insertion in model container [2024-11-22 05:16:37,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:36" (2/3) ... [2024-11-22 05:16:37,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e63ef2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:16:37, skipping insertion in model container [2024-11-22 05:16:37,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:16:37" (3/3) ... [2024-11-22 05:16:37,739 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_segments.c [2024-11-22 05:16:37,752 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 05:16:37,753 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 05:16:37,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 05:16:37,802 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;@c7141ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 05:16:37,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 05:16:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:37,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 05:16:37,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:37,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:37,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:37,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:37,819 INFO L85 PathProgramCache]: Analyzing trace with hash 365214336, now seen corresponding path program 1 times [2024-11-22 05:16:37,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:37,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589962350] [2024-11-22 05:16:37,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:37,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:38,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:38,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589962350] [2024-11-22 05:16:38,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589962350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:38,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:38,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:16:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437082425] [2024-11-22 05:16:38,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:38,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:16:38,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:38,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:16:38,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:16:38,473 INFO L87 Difference]: Start difference. First operand has 82 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 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 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:38,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:38,521 INFO L93 Difference]: Finished difference Result 157 states and 231 transitions. [2024-11-22 05:16:38,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:16:38,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-22 05:16:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:38,531 INFO L225 Difference]: With dead ends: 157 [2024-11-22 05:16:38,531 INFO L226 Difference]: Without dead ends: 81 [2024-11-22 05:16:38,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:16:38,538 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:38,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:16:38,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-22 05:16:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-22 05:16:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-11-22 05:16:38,574 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 31 [2024-11-22 05:16:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:38,575 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-11-22 05:16:38,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-11-22 05:16:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-22 05:16:38,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:38,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:38,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 05:16:38,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:38,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:38,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1561562150, now seen corresponding path program 1 times [2024-11-22 05:16:38,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:38,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96316323] [2024-11-22 05:16:38,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:38,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:38,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96316323] [2024-11-22 05:16:38,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96316323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:38,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:38,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:16:38,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377838680] [2024-11-22 05:16:38,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:38,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:16:38,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:38,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:16:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:16:38,746 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:38,772 INFO L93 Difference]: Finished difference Result 158 states and 229 transitions. [2024-11-22 05:16:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:16:38,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-22 05:16:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:38,776 INFO L225 Difference]: With dead ends: 158 [2024-11-22 05:16:38,776 INFO L226 Difference]: Without dead ends: 83 [2024-11-22 05:16:38,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:16:38,778 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:38,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:16:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-22 05:16:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-22 05:16:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.451219512195122) internal successors, (119), 82 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2024-11-22 05:16:38,787 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 32 [2024-11-22 05:16:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:38,788 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2024-11-22 05:16:38,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2024-11-22 05:16:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 05:16:38,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:38,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:38,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 05:16:38,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:38,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2033215129, now seen corresponding path program 1 times [2024-11-22 05:16:38,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:38,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105483835] [2024-11-22 05:16:38,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:38,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:39,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:39,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105483835] [2024-11-22 05:16:39,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105483835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:39,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:39,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 05:16:39,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854502274] [2024-11-22 05:16:39,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:39,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 05:16:39,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:39,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 05:16:39,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 05:16:39,223 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:39,300 INFO L93 Difference]: Finished difference Result 164 states and 236 transitions. [2024-11-22 05:16:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 05:16:39,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-22 05:16:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:39,304 INFO L225 Difference]: With dead ends: 164 [2024-11-22 05:16:39,304 INFO L226 Difference]: Without dead ends: 87 [2024-11-22 05:16:39,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:16:39,305 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 98 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:39,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 415 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:16:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-22 05:16:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-22 05:16:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-22 05:16:39,316 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 33 [2024-11-22 05:16:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:39,316 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-22 05:16:39,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-22 05:16:39,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-22 05:16:39,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:39,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:39,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 05:16:39,319 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 169704829, now seen corresponding path program 1 times [2024-11-22 05:16:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021846690] [2024-11-22 05:16:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:40,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021846690] [2024-11-22 05:16:40,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021846690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:40,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:40,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 05:16:40,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997576236] [2024-11-22 05:16:40,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:40,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 05:16:40,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:40,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 05:16:40,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:16:40,068 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:40,179 INFO L93 Difference]: Finished difference Result 174 states and 248 transitions. [2024-11-22 05:16:40,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 05:16:40,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-22 05:16:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:40,182 INFO L225 Difference]: With dead ends: 174 [2024-11-22 05:16:40,182 INFO L226 Difference]: Without dead ends: 94 [2024-11-22 05:16:40,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-22 05:16:40,184 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 122 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:40,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 535 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:16:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-22 05:16:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-11-22 05:16:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-22 05:16:40,190 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 34 [2024-11-22 05:16:40,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:40,191 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-22 05:16:40,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-22 05:16:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 05:16:40,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:40,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:40,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 05:16:40,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:40,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:40,193 INFO L85 PathProgramCache]: Analyzing trace with hash -301874261, now seen corresponding path program 1 times [2024-11-22 05:16:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:40,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162804548] [2024-11-22 05:16:40,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:40,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:40,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:40,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162804548] [2024-11-22 05:16:40,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162804548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:40,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:40,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 05:16:40,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803310625] [2024-11-22 05:16:40,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:40,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 05:16:40,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:40,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 05:16:40,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-22 05:16:40,792 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:40,886 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2024-11-22 05:16:40,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 05:16:40,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-22 05:16:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:40,887 INFO L225 Difference]: With dead ends: 184 [2024-11-22 05:16:40,887 INFO L226 Difference]: Without dead ends: 99 [2024-11-22 05:16:40,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-22 05:16:40,888 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 114 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:40,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 812 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:16:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-22 05:16:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-22 05:16:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-11-22 05:16:40,898 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 35 [2024-11-22 05:16:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:40,899 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-11-22 05:16:40,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-11-22 05:16:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 05:16:40,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:40,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:40,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 05:16:40,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:40,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash -37543868, now seen corresponding path program 1 times [2024-11-22 05:16:40,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:40,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801440185] [2024-11-22 05:16:40,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:40,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:41,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:41,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801440185] [2024-11-22 05:16:41,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801440185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:41,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:41,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 05:16:41,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358346197] [2024-11-22 05:16:41,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:41,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 05:16:41,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:41,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 05:16:41,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:16:41,019 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:41,065 INFO L93 Difference]: Finished difference Result 270 states and 377 transitions. [2024-11-22 05:16:41,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:16:41,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-22 05:16:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:41,066 INFO L225 Difference]: With dead ends: 270 [2024-11-22 05:16:41,066 INFO L226 Difference]: Without dead ends: 180 [2024-11-22 05:16:41,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:16:41,069 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 301 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:41,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:16:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-22 05:16:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 108. [2024-11-22 05:16:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.4018691588785046) internal successors, (150), 107 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2024-11-22 05:16:41,080 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 35 [2024-11-22 05:16:41,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:41,081 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2024-11-22 05:16:41,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2024-11-22 05:16:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 05:16:41,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:41,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:41,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 05:16:41,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:41,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash 580893341, now seen corresponding path program 1 times [2024-11-22 05:16:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:41,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691824749] [2024-11-22 05:16:41,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:41,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:41,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:41,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691824749] [2024-11-22 05:16:41,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691824749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:41,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:41,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 05:16:41,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143664735] [2024-11-22 05:16:41,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:41,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 05:16:41,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:41,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 05:16:41,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:16:41,225 INFO L87 Difference]: Start difference. First operand 108 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:41,283 INFO L93 Difference]: Finished difference Result 264 states and 366 transitions. [2024-11-22 05:16:41,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:16:41,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-22 05:16:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:41,285 INFO L225 Difference]: With dead ends: 264 [2024-11-22 05:16:41,285 INFO L226 Difference]: Without dead ends: 170 [2024-11-22 05:16:41,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:16:41,286 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 289 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:41,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:16:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-22 05:16:41,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 104. [2024-11-22 05:16:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2024-11-22 05:16:41,292 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 35 [2024-11-22 05:16:41,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:41,292 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2024-11-22 05:16:41,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2024-11-22 05:16:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-22 05:16:41,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:41,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:41,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 05:16:41,294 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:41,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1650261173, now seen corresponding path program 1 times [2024-11-22 05:16:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:41,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806142356] [2024-11-22 05:16:41,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:41,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:41,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806142356] [2024-11-22 05:16:41,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806142356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:41,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:41,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 05:16:41,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089450049] [2024-11-22 05:16:41,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:41,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 05:16:41,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:41,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 05:16:41,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-22 05:16:41,726 INFO L87 Difference]: Start difference. First operand 104 states and 144 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:41,844 INFO L93 Difference]: Finished difference Result 209 states and 292 transitions. [2024-11-22 05:16:41,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 05:16:41,845 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-22 05:16:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:41,846 INFO L225 Difference]: With dead ends: 209 [2024-11-22 05:16:41,846 INFO L226 Difference]: Without dead ends: 119 [2024-11-22 05:16:41,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-22 05:16:41,847 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 121 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:41,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 783 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:16:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-22 05:16:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2024-11-22 05:16:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 112 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2024-11-22 05:16:41,852 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 36 [2024-11-22 05:16:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:41,853 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2024-11-22 05:16:41,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2024-11-22 05:16:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 05:16:41,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:41,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:41,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 05:16:41,854 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:41,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1263227207, now seen corresponding path program 1 times [2024-11-22 05:16:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:41,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168528360] [2024-11-22 05:16:41,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:41,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:42,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:42,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168528360] [2024-11-22 05:16:42,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168528360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:42,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:42,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 05:16:42,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206875728] [2024-11-22 05:16:42,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:42,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 05:16:42,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:42,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 05:16:42,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-22 05:16:42,395 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:42,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:42,610 INFO L93 Difference]: Finished difference Result 226 states and 316 transitions. [2024-11-22 05:16:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 05:16:42,611 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-22 05:16:42,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:42,611 INFO L225 Difference]: With dead ends: 226 [2024-11-22 05:16:42,612 INFO L226 Difference]: Without dead ends: 127 [2024-11-22 05:16:42,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-22 05:16:42,613 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 126 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:42,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1111 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 05:16:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-22 05:16:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2024-11-22 05:16:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.4) internal successors, (168), 120 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 168 transitions. [2024-11-22 05:16:42,618 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 168 transitions. Word has length 37 [2024-11-22 05:16:42,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:42,618 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 168 transitions. [2024-11-22 05:16:42,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:42,618 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 168 transitions. [2024-11-22 05:16:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 05:16:42,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:42,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:42,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 05:16:42,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:42,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:42,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1918885507, now seen corresponding path program 1 times [2024-11-22 05:16:42,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:42,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131314133] [2024-11-22 05:16:42,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:42,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:43,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:43,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131314133] [2024-11-22 05:16:43,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131314133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:43,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:43,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-22 05:16:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262645416] [2024-11-22 05:16:43,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:43,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 05:16:43,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:43,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 05:16:43,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-22 05:16:43,159 INFO L87 Difference]: Start difference. First operand 121 states and 168 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:43,400 INFO L93 Difference]: Finished difference Result 253 states and 353 transitions. [2024-11-22 05:16:43,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 05:16:43,401 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-22 05:16:43,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:43,401 INFO L225 Difference]: With dead ends: 253 [2024-11-22 05:16:43,401 INFO L226 Difference]: Without dead ends: 146 [2024-11-22 05:16:43,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-22 05:16:43,403 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 135 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:43,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1235 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 05:16:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-22 05:16:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2024-11-22 05:16:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2024-11-22 05:16:43,407 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 194 transitions. Word has length 37 [2024-11-22 05:16:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:43,407 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 194 transitions. [2024-11-22 05:16:43,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2024-11-22 05:16:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 05:16:43,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:43,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:43,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 05:16:43,412 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:43,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1515202326, now seen corresponding path program 1 times [2024-11-22 05:16:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:43,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19093311] [2024-11-22 05:16:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:43,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:43,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19093311] [2024-11-22 05:16:43,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19093311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:43,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:43,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 05:16:43,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431779284] [2024-11-22 05:16:43,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:43,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 05:16:43,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:43,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 05:16:43,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:16:43,528 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:43,572 INFO L93 Difference]: Finished difference Result 350 states and 487 transitions. [2024-11-22 05:16:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:16:43,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-22 05:16:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:43,574 INFO L225 Difference]: With dead ends: 350 [2024-11-22 05:16:43,574 INFO L226 Difference]: Without dead ends: 225 [2024-11-22 05:16:43,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:16:43,575 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 269 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:43,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:16:43,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-22 05:16:43,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 159. [2024-11-22 05:16:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.379746835443038) internal successors, (218), 158 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 218 transitions. [2024-11-22 05:16:43,579 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 218 transitions. Word has length 37 [2024-11-22 05:16:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:43,579 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 218 transitions. [2024-11-22 05:16:43,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 218 transitions. [2024-11-22 05:16:43,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 05:16:43,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:43,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:43,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 05:16:43,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:43,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:43,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1136610428, now seen corresponding path program 1 times [2024-11-22 05:16:43,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:43,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714738078] [2024-11-22 05:16:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:43,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:43,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714738078] [2024-11-22 05:16:43,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714738078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:43,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:43,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 05:16:43,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197068451] [2024-11-22 05:16:43,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:43,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 05:16:43,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:43,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 05:16:43,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:16:43,727 INFO L87 Difference]: Start difference. First operand 159 states and 218 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:43,791 INFO L93 Difference]: Finished difference Result 343 states and 474 transitions. [2024-11-22 05:16:43,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:16:43,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-22 05:16:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:43,793 INFO L225 Difference]: With dead ends: 343 [2024-11-22 05:16:43,793 INFO L226 Difference]: Without dead ends: 206 [2024-11-22 05:16:43,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:16:43,794 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 258 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:43,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:16:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-22 05:16:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 149. [2024-11-22 05:16:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.3783783783783783) internal successors, (204), 148 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 204 transitions. [2024-11-22 05:16:43,805 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 204 transitions. Word has length 37 [2024-11-22 05:16:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:43,806 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 204 transitions. [2024-11-22 05:16:43,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 204 transitions. [2024-11-22 05:16:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 05:16:43,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:43,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:43,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 05:16:43,809 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:43,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1881024206, now seen corresponding path program 1 times [2024-11-22 05:16:43,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:43,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646597397] [2024-11-22 05:16:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:43,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:16:43,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646597397] [2024-11-22 05:16:43,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646597397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:43,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:43,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 05:16:43,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098115805] [2024-11-22 05:16:43,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:43,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 05:16:43,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:16:43,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 05:16:43,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:16:43,958 INFO L87 Difference]: Start difference. First operand 149 states and 204 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:44,018 INFO L93 Difference]: Finished difference Result 325 states and 449 transitions. [2024-11-22 05:16:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:16:44,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-11-22 05:16:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:44,020 INFO L225 Difference]: With dead ends: 325 [2024-11-22 05:16:44,020 INFO L226 Difference]: Without dead ends: 200 [2024-11-22 05:16:44,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:16:44,021 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 240 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:44,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:16:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-22 05:16:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 157. [2024-11-22 05:16:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.3653846153846154) internal successors, (213), 156 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 213 transitions. [2024-11-22 05:16:44,030 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 213 transitions. Word has length 38 [2024-11-22 05:16:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:44,031 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 213 transitions. [2024-11-22 05:16:44,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 213 transitions. [2024-11-22 05:16:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 05:16:44,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:44,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:44,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 05:16:44,033 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:44,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2086330599, now seen corresponding path program 1 times [2024-11-22 05:16:44,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:16:44,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797326192] [2024-11-22 05:16:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:44,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:16:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 05:16:44,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 05:16:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 05:16:44,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 05:16:44,138 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 05:16:44,140 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 05:16:44,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 05:16:44,145 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:44,210 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 05:16:44,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:16:44 BoogieIcfgContainer [2024-11-22 05:16:44,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 05:16:44,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 05:16:44,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 05:16:44,214 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 05:16:44,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:16:37" (3/4) ... [2024-11-22 05:16:44,217 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 05:16:44,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 05:16:44,219 INFO L158 Benchmark]: Toolchain (without parser) took 7785.93ms. Allocated memory was 190.8MB in the beginning and 333.4MB in the end (delta: 142.6MB). Free memory was 122.0MB in the beginning and 237.7MB in the end (delta: -115.7MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-11-22 05:16:44,219 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 117.4MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:16:44,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.98ms. Allocated memory is still 190.8MB. Free memory was 121.7MB in the beginning and 105.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 05:16:44,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.72ms. Allocated memory is still 190.8MB. Free memory was 105.2MB in the beginning and 97.4MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-22 05:16:44,220 INFO L158 Benchmark]: Boogie Preprocessor took 93.09ms. Allocated memory is still 190.8MB. Free memory was 97.4MB in the beginning and 92.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 05:16:44,220 INFO L158 Benchmark]: RCFGBuilder took 751.53ms. Allocated memory is still 190.8MB. Free memory was 92.4MB in the beginning and 122.2MB in the end (delta: -29.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-22 05:16:44,221 INFO L158 Benchmark]: TraceAbstraction took 6479.80ms. Allocated memory was 190.8MB in the beginning and 333.4MB in the end (delta: 142.6MB). Free memory was 121.2MB in the beginning and 238.7MB in the end (delta: -117.5MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-11-22 05:16:44,221 INFO L158 Benchmark]: Witness Printer took 4.76ms. Allocated memory is still 333.4MB. Free memory was 238.7MB in the beginning and 237.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 05:16:44,222 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 117.4MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.98ms. Allocated memory is still 190.8MB. Free memory was 121.7MB in the beginning and 105.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.72ms. Allocated memory is still 190.8MB. Free memory was 105.2MB in the beginning and 97.4MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.09ms. Allocated memory is still 190.8MB. Free memory was 97.4MB in the beginning and 92.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 751.53ms. Allocated memory is still 190.8MB. Free memory was 92.4MB in the beginning and 122.2MB in the end (delta: -29.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6479.80ms. Allocated memory was 190.8MB in the beginning and 333.4MB in the end (delta: 142.6MB). Free memory was 121.2MB in the beginning and 238.7MB in the end (delta: -117.5MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Witness Printer took 4.76ms. Allocated memory is still 333.4MB. Free memory was 238.7MB in the beginning and 237.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 113. 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 8); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (8 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L35] const SORT_52 mask_SORT_52 = (SORT_52)-1 >> (sizeof(SORT_52) * 8 - 2); [L36] const SORT_52 msb_SORT_52 = (SORT_52)1 << (2 - 1); [L38] const SORT_54 mask_SORT_54 = (SORT_54)-1 >> (sizeof(SORT_54) * 8 - 3); [L39] const SORT_54 msb_SORT_54 = (SORT_54)1 << (3 - 1); [L41] const SORT_4 var_5 = 0; [L42] const SORT_8 var_10 = 0; [L43] const SORT_8 var_13 = 1; [L44] const SORT_8 var_17 = 2; [L45] const SORT_8 var_21 = 3; [L46] const SORT_8 var_25 = 4; [L47] const SORT_1 var_30 = 1; [L48] const SORT_4 var_41 = 1; [L49] const SORT_4 var_44 = 4; [L50] const SORT_4 var_45 = 3; [L51] const SORT_4 var_50 = 2; [L53] SORT_1 input_2; [L54] SORT_1 input_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L56] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L58] SORT_4 init_7_arg_1 = var_5; [L59] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L62] input_2 = __VERIFIER_nondet_uchar() [L63] input_3 = __VERIFIER_nondet_uchar() [L64] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L64] input_3 = input_3 & mask_SORT_1 [L67] SORT_4 var_9_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9_arg_0=0] [L68] EXPR var_9_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L68] var_9_arg_0 = var_9_arg_0 & mask_SORT_4 [L69] SORT_8 var_9 = var_9_arg_0; [L70] SORT_8 var_11_arg_0 = var_9; [L71] SORT_8 var_11_arg_1 = var_10; [L72] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L73] SORT_4 var_12_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_11=1, var_12_arg_0=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L74] EXPR var_12_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_11=1, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L74] var_12_arg_0 = var_12_arg_0 & mask_SORT_4 [L75] SORT_8 var_12 = var_12_arg_0; [L76] SORT_8 var_14_arg_0 = var_12; [L77] SORT_8 var_14_arg_1 = var_13; [L78] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L79] SORT_1 var_15_arg_0 = var_11; [L80] SORT_1 var_15_arg_1 = var_14; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_15_arg_0=1, var_15_arg_1=0, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L81] EXPR var_15_arg_0 | var_15_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L81] SORT_1 var_15 = var_15_arg_0 | var_15_arg_1; [L82] SORT_4 var_16_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_15=1, var_16_arg_0=0, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L83] EXPR var_16_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_15=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L83] var_16_arg_0 = var_16_arg_0 & mask_SORT_4 [L84] SORT_8 var_16 = var_16_arg_0; [L85] SORT_8 var_18_arg_0 = var_16; [L86] SORT_8 var_18_arg_1 = var_17; [L87] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L88] SORT_1 var_19_arg_0 = var_15; [L89] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_19_arg_0=1, var_19_arg_1=0, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L90] EXPR var_19_arg_0 | var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L90] SORT_1 var_19 = var_19_arg_0 | var_19_arg_1; [L91] SORT_4 var_20_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_19=1, var_20_arg_0=0, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L92] EXPR var_20_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_19=1, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L92] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L93] SORT_8 var_20 = var_20_arg_0; [L94] SORT_8 var_22_arg_0 = var_20; [L95] SORT_8 var_22_arg_1 = var_21; [L96] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L97] SORT_1 var_23_arg_0 = var_19; [L98] SORT_1 var_23_arg_1 = var_22; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_23_arg_0=1, var_23_arg_1=0, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L99] EXPR var_23_arg_0 | var_23_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L99] SORT_1 var_23 = var_23_arg_0 | var_23_arg_1; [L100] SORT_4 var_24_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_23=1, var_24_arg_0=0, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L101] EXPR var_24_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_23=1, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L101] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L102] SORT_8 var_24 = var_24_arg_0; [L103] SORT_8 var_26_arg_0 = var_24; [L104] SORT_8 var_26_arg_1 = var_25; [L105] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L106] SORT_1 var_27_arg_0 = var_23; [L107] SORT_1 var_27_arg_1 = var_26; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_27_arg_0=1, var_27_arg_1=0, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L108] SORT_1 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_1 var_31_arg_0 = var_27; [L110] SORT_1 var_31 = ~var_31_arg_0; [L111] SORT_1 var_32_arg_0 = var_30; [L112] SORT_1 var_32_arg_1 = var_31; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_32_arg_0=1, var_32_arg_1=-2, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L113] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L114] var_32 = var_32 & mask_SORT_1 [L115] SORT_1 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2073 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2073 mSDsluCounter, 7113 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5750 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1181 IncrementalHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1363 mSDtfsCounter, 1181 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=11, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 330 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 1385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 05:16:44,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 05:16:46,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 05:16:46,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-22 05:16:46,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 05:16:46,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 05:16:46,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 05:16:46,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 05:16:46,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 05:16:46,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 05:16:46,585 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 05:16:46,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 05:16:46,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 05:16:46,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 05:16:46,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 05:16:46,586 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 05:16:46,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 05:16:46,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 05:16:46,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 05:16:46,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 05:16:46,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 05:16:46,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 05:16:46,591 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 05:16:46,591 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 05:16:46,591 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 05:16:46,591 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 05:16:46,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 05:16:46,592 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 05:16:46,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 05:16:46,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 05:16:46,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 05:16:46,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 05:16:46,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:16:46,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 05:16:46,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 05:16:46,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 05:16:46,603 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 05:16:46,604 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 05:16:46,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 05:16:46,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 05:16:46,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 05:16:46,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 05:16:46,605 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 [2024-11-22 05:16:46,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 05:16:46,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 05:16:46,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 05:16:46,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 05:16:46,941 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 05:16:46,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-11-22 05:16:48,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 05:16:48,651 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 05:16:48,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-11-22 05:16:48,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f32039a0f/94694fd31c6448ceab89b7754dd8762e/FLAG1a01363b1 [2024-11-22 05:16:48,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f32039a0f/94694fd31c6448ceab89b7754dd8762e [2024-11-22 05:16:48,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 05:16:48,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 05:16:48,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 05:16:48,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 05:16:48,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 05:16:48,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:16:48" (1/1) ... [2024-11-22 05:16:48,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db79be5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:48, skipping insertion in model container [2024-11-22 05:16:48,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:16:48" (1/1) ... [2024-11-22 05:16:48,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 05:16:48,874 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2024-11-22 05:16:48,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:16:48,962 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 05:16:48,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2024-11-22 05:16:49,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:16:49,027 INFO L204 MainTranslator]: Completed translation [2024-11-22 05:16:49,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49 WrapperNode [2024-11-22 05:16:49,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 05:16:49,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 05:16:49,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 05:16:49,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 05:16:49,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (1/1) ... [2024-11-22 05:16:49,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (1/1) ... [2024-11-22 05:16:49,068 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 164 [2024-11-22 05:16:49,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 05:16:49,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 05:16:49,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 05:16:49,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 05:16:49,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (1/1) ... [2024-11-22 05:16:49,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (1/1) ... [2024-11-22 05:16:49,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (1/1) ... [2024-11-22 05:16:49,107 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 05:16:49,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (1/1) ... [2024-11-22 05:16:49,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (1/1) ... [2024-11-22 05:16:49,116 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (1/1) ... [2024-11-22 05:16:49,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (1/1) ... [2024-11-22 05:16:49,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (1/1) ... [2024-11-22 05:16:49,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (1/1) ... [2024-11-22 05:16:49,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 05:16:49,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 05:16:49,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 05:16:49,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 05:16:49,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (1/1) ... [2024-11-22 05:16:49,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:16:49,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:16:49,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 05:16:49,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 05:16:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 05:16:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 05:16:49,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 05:16:49,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 05:16:49,316 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 05:16:49,318 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 05:16:49,576 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-22 05:16:49,576 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 05:16:49,594 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 05:16:49,594 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 05:16:49,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:16:49 BoogieIcfgContainer [2024-11-22 05:16:49,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 05:16:49,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 05:16:49,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 05:16:49,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 05:16:49,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:16:48" (1/3) ... [2024-11-22 05:16:49,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb9b7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:16:49, skipping insertion in model container [2024-11-22 05:16:49,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:16:49" (2/3) ... [2024-11-22 05:16:49,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb9b7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:16:49, skipping insertion in model container [2024-11-22 05:16:49,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:16:49" (3/3) ... [2024-11-22 05:16:49,609 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_segments.c [2024-11-22 05:16:49,629 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 05:16:49,630 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 05:16:49,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 05:16:49,731 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;@3894b54c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 05:16:49,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 05:16:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:49,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 05:16:49,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:49,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 05:16:49,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:49,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-22 05:16:49,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:16:49,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696017388] [2024-11-22 05:16:49,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:49,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:16:49,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:16:49,774 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:16:49,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 05:16:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:49,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 05:16:49,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:16:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:50,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 05:16:50,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:16:50,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696017388] [2024-11-22 05:16:50,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696017388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:16:50,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:16:50,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:16:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261686918] [2024-11-22 05:16:50,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:16:50,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:16:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:16:50,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:16:50,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:16:50,159 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:16:50,230 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-22 05:16:50,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:16:50,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-22 05:16:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:16:50,239 INFO L225 Difference]: With dead ends: 18 [2024-11-22 05:16:50,239 INFO L226 Difference]: Without dead ends: 10 [2024-11-22 05:16:50,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-22 05:16:50,244 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:16:50,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:16:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-22 05:16:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-22 05:16:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-22 05:16:50,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-22 05:16:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:16:50,271 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-22 05:16:50,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:16:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-22 05:16:50,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 05:16:50,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:16:50,272 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-22 05:16:50,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 05:16:50,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:16:50,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:16:50,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:16:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-22 05:16:50,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:16:50,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470092947] [2024-11-22 05:16:50,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:16:50,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:16:50,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:16:50,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:16:50,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 05:16:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:16:50,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-22 05:16:50,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:16:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:16:51,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:17:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:17:22,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:17:22,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470092947] [2024-11-22 05:17:22,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470092947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:17:22,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 05:17:22,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 05:17:22,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420112528] [2024-11-22 05:17:22,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 05:17:22,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 05:17:22,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:17:22,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 05:17:22,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-22 05:17:22,790 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:17:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:17:22,882 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-22 05:17:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 05:17:22,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 8 [2024-11-22 05:17:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:17:22,883 INFO L225 Difference]: With dead ends: 15 [2024-11-22 05:17:22,883 INFO L226 Difference]: Without dead ends: 13 [2024-11-22 05:17:22,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-22 05:17:22,885 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:17:22,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:17:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-22 05:17:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-22 05:17:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:17:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-22 05:17:22,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-22 05:17:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:17:22,888 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-22 05:17:22,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:17:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-22 05:17:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 05:17:22,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:17:22,889 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-22 05:17:22,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 05:17:23,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:17:23,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:17:23,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:17:23,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-22 05:17:23,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:17:23,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964795451] [2024-11-22 05:17:23,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 05:17:23,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:17:23,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:17:23,098 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:17:23,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 05:17:23,196 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 05:17:23,196 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:17:23,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-22 05:17:23,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:17:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:17:24,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:17:57,273 WARN L286 SmtUtils]: Spent 10.48s on a formula simplification that was a NOOP. DAG size: 582 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)