./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.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 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 17:27:57,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 17:27:57,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-18 17:27:57,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 17:27:57,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 17:27:57,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 17:27:57,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 17:27:57,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 17:27:57,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 17:27:57,342 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 17:27:57,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 17:27:57,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 17:27:57,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 17:27:57,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 17:27:57,345 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 17:27:57,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 17:27:57,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 17:27:57,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 17:27:57,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 17:27:57,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 17:27:57,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 17:27:57,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 17:27:57,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 17:27:57,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 17:27:57,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 17:27:57,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 17:27:57,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 17:27:57,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 17:27:57,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 17:27:57,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:27:57,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 17:27:57,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 17:27:57,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 17:27:57,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 17:27:57,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 17:27:57,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 17:27:57,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 17:27:57,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 17:27:57,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 17:27:57,359 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 -> 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e [2024-11-18 17:27:57,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 17:27:57,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 17:27:57,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 17:27:57,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 17:27:57,660 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 17:27:57,661 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_b04.c [2024-11-18 17:27:59,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 17:27:59,302 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 17:27:59,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2024-11-18 17:27:59,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/341fa9a11/c9b7c582fa964d64a35f0012135787c8/FLAG020ad4037 [2024-11-18 17:27:59,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/341fa9a11/c9b7c582fa964d64a35f0012135787c8 [2024-11-18 17:27:59,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 17:27:59,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 17:27:59,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 17:27:59,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 17:27:59,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 17:27:59,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:27:59,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5910d7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59, skipping insertion in model container [2024-11-18 17:27:59,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:27:59,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 17:27:59,897 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_b04.c[1245,1258] [2024-11-18 17:27:59,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:27:59,946 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 17:27:59,959 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_b04.c[1245,1258] [2024-11-18 17:27:59,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:27:59,993 INFO L204 MainTranslator]: Completed translation [2024-11-18 17:27:59,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59 WrapperNode [2024-11-18 17:27:59,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 17:27:59,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 17:27:59,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 17:27:59,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 17:28:00,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:28:00,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:28:00,108 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 216 [2024-11-18 17:28:00,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 17:28:00,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 17:28:00,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 17:28:00,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 17:28:00,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:28:00,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:28:00,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:28:00,152 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-18 17:28:00,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:28:00,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:28:00,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:28:00,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:28:00,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:28:00,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:28:00,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 17:28:00,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 17:28:00,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 17:28:00,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 17:28:00,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (1/1) ... [2024-11-18 17:28:00,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:28:00,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:28:00,220 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-18 17:28:00,222 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-18 17:28:00,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 17:28:00,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 17:28:00,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 17:28:00,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 17:28:00,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 17:28:00,330 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 17:28:00,332 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 17:28:00,765 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-18 17:28:00,765 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 17:28:00,782 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 17:28:00,782 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 17:28:00,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:28:00 BoogieIcfgContainer [2024-11-18 17:28:00,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 17:28:00,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 17:28:00,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 17:28:00,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 17:28:00,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:27:59" (1/3) ... [2024-11-18 17:28:00,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea4b856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:28:00, skipping insertion in model container [2024-11-18 17:28:00,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:59" (2/3) ... [2024-11-18 17:28:00,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea4b856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:28:00, skipping insertion in model container [2024-11-18 17:28:00,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:28:00" (3/3) ... [2024-11-18 17:28:00,793 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b04.c [2024-11-18 17:28:00,808 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 17:28:00,808 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 17:28:00,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 17:28:00,885 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;@591b1f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 17:28:00,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 17:28:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 45 states have internal predecessors, (65), 0 states have call successors, (0), 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-18 17:28:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-18 17:28:00,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:00,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:00,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:00,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1343812480, now seen corresponding path program 1 times [2024-11-18 17:28:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:00,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012484305] [2024-11-18 17:28:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:00,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:01,355 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-18 17:28:01,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:01,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012484305] [2024-11-18 17:28:01,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012484305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:01,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:01,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:28:01,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523175334] [2024-11-18 17:28:01,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:01,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:28:01,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:01,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:28:01,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:28:01,422 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 45 states have internal predecessors, (65), 0 states have call successors, (0), 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 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:01,461 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2024-11-18 17:28:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:28:01,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-18 17:28:01,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:01,498 INFO L225 Difference]: With dead ends: 77 [2024-11-18 17:28:01,498 INFO L226 Difference]: Without dead ends: 45 [2024-11-18 17:28:01,502 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-18 17:28:01,506 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 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-18 17:28:01,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:28:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-18 17:28:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-18 17:28:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 0 states have call successors, (0), 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-18 17:28:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-18 17:28:01,538 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 21 [2024-11-18 17:28:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:01,539 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-18 17:28:01,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2024-11-18 17:28:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 17:28:01,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:01,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:01,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 17:28:01,541 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:01,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1293181337, now seen corresponding path program 1 times [2024-11-18 17:28:01,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:01,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715025866] [2024-11-18 17:28:01,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:01,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:01,704 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-18 17:28:01,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:01,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715025866] [2024-11-18 17:28:01,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715025866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:01,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:01,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:28:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874792613] [2024-11-18 17:28:01,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:01,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:28:01,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:28:01,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:28:01,710 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:01,735 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2024-11-18 17:28:01,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:28:01,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-18 17:28:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:01,737 INFO L225 Difference]: With dead ends: 78 [2024-11-18 17:28:01,737 INFO L226 Difference]: Without dead ends: 47 [2024-11-18 17:28:01,737 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-18 17:28:01,739 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 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-18 17:28:01,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:28:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-18 17:28:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-18 17:28:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 0 states have call successors, (0), 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-18 17:28:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-18 17:28:01,746 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 22 [2024-11-18 17:28:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:01,746 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-18 17:28:01,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-18 17:28:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 17:28:01,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:01,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:01,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 17:28:01,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:01,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash 335949945, now seen corresponding path program 1 times [2024-11-18 17:28:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:01,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189347207] [2024-11-18 17:28:01,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:02,066 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-18 17:28:02,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:02,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189347207] [2024-11-18 17:28:02,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189347207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:02,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:02,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:28:02,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653753528] [2024-11-18 17:28:02,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:02,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:28:02,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:02,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:28:02,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:28:02,071 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:02,098 INFO L93 Difference]: Finished difference Result 80 states and 110 transitions. [2024-11-18 17:28:02,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:28:02,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-18 17:28:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:02,099 INFO L225 Difference]: With dead ends: 80 [2024-11-18 17:28:02,099 INFO L226 Difference]: Without dead ends: 47 [2024-11-18 17:28:02,100 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-18 17:28:02,102 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:02,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 155 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:28:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-18 17:28:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-18 17:28:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 0 states have call successors, (0), 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-18 17:28:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2024-11-18 17:28:02,110 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 23 [2024-11-18 17:28:02,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:02,110 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2024-11-18 17:28:02,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2024-11-18 17:28:02,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 17:28:02,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:02,111 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] [2024-11-18 17:28:02,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 17:28:02,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:02,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:02,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1561566688, now seen corresponding path program 1 times [2024-11-18 17:28:02,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:02,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896570000] [2024-11-18 17:28:02,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:02,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:02,478 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-18 17:28:02,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896570000] [2024-11-18 17:28:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896570000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:02,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:02,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 17:28:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278059140] [2024-11-18 17:28:02,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:02,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 17:28:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:02,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 17:28:02,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-18 17:28:02,482 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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-18 17:28:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:02,605 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2024-11-18 17:28:02,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 17:28:02,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-18 17:28:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:02,606 INFO L225 Difference]: With dead ends: 90 [2024-11-18 17:28:02,608 INFO L226 Difference]: Without dead ends: 57 [2024-11-18 17:28:02,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-18 17:28:02,609 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 68 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:02,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 304 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:28:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-18 17:28:02,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2024-11-18 17:28:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-11-18 17:28:02,620 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 24 [2024-11-18 17:28:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:02,620 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-11-18 17:28:02,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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-18 17:28:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-11-18 17:28:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 17:28:02,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:02,621 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] [2024-11-18 17:28:02,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 17:28:02,621 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:02,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:02,622 INFO L85 PathProgramCache]: Analyzing trace with hash -844580682, now seen corresponding path program 1 times [2024-11-18 17:28:02,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:02,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677794384] [2024-11-18 17:28:02,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:02,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:03,319 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-18 17:28:03,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:03,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677794384] [2024-11-18 17:28:03,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677794384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:03,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:03,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 17:28:03,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249749227] [2024-11-18 17:28:03,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:03,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 17:28:03,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:03,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 17:28:03,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-18 17:28:03,324 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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-18 17:28:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:03,499 INFO L93 Difference]: Finished difference Result 103 states and 139 transitions. [2024-11-18 17:28:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 17:28:03,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-18 17:28:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:03,501 INFO L225 Difference]: With dead ends: 103 [2024-11-18 17:28:03,501 INFO L226 Difference]: Without dead ends: 61 [2024-11-18 17:28:03,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-18 17:28:03,502 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:03,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 368 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:28:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-18 17:28:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-11-18 17:28:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2024-11-18 17:28:03,513 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 25 [2024-11-18 17:28:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:03,513 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2024-11-18 17:28:03,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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-18 17:28:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2024-11-18 17:28:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 17:28:03,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:03,517 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] [2024-11-18 17:28:03,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 17:28:03,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:03,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:03,518 INFO L85 PathProgramCache]: Analyzing trace with hash -318785717, now seen corresponding path program 1 times [2024-11-18 17:28:03,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:03,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548556970] [2024-11-18 17:28:03,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:03,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:03,743 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-18 17:28:03,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:03,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548556970] [2024-11-18 17:28:03,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548556970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:03,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 17:28:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073578825] [2024-11-18 17:28:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:03,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 17:28:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 17:28:03,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 17:28:03,748 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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-18 17:28:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:03,847 INFO L93 Difference]: Finished difference Result 135 states and 178 transitions. [2024-11-18 17:28:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 17:28:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-18 17:28:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:03,849 INFO L225 Difference]: With dead ends: 135 [2024-11-18 17:28:03,849 INFO L226 Difference]: Without dead ends: 89 [2024-11-18 17:28:03,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 17:28:03,851 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:03,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 120 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:28:03,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-18 17:28:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2024-11-18 17:28:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2024-11-18 17:28:03,856 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 25 [2024-11-18 17:28:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:03,857 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2024-11-18 17:28:03,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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-18 17:28:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2024-11-18 17:28:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 17:28:03,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:03,858 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] [2024-11-18 17:28:03,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 17:28:03,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:03,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1152347839, now seen corresponding path program 1 times [2024-11-18 17:28:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:03,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731294308] [2024-11-18 17:28:03,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:04,080 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-18 17:28:04,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:04,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731294308] [2024-11-18 17:28:04,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731294308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:04,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:04,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 17:28:04,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29150629] [2024-11-18 17:28:04,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:04,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 17:28:04,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:04,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 17:28:04,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 17:28:04,083 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-18 17:28:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:04,114 INFO L93 Difference]: Finished difference Result 114 states and 152 transitions. [2024-11-18 17:28:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 17:28:04,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-18 17:28:04,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:04,116 INFO L225 Difference]: With dead ends: 114 [2024-11-18 17:28:04,117 INFO L226 Difference]: Without dead ends: 68 [2024-11-18 17:28:04,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 17:28:04,118 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 51 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:04,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 161 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:28:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-18 17:28:04,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-18 17:28:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2024-11-18 17:28:04,125 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 26 [2024-11-18 17:28:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:04,125 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2024-11-18 17:28:04,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-18 17:28:04,126 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2024-11-18 17:28:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 17:28:04,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:04,130 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] [2024-11-18 17:28:04,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 17:28:04,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:04,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1970135151, now seen corresponding path program 1 times [2024-11-18 17:28:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:04,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956874924] [2024-11-18 17:28:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:04,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-18 17:28:04,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:04,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956874924] [2024-11-18 17:28:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956874924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:04,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:04,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 17:28:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027278662] [2024-11-18 17:28:04,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:04,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 17:28:04,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:04,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 17:28:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 17:28:04,394 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-18 17:28:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:04,467 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2024-11-18 17:28:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 17:28:04,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-18 17:28:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:04,468 INFO L225 Difference]: With dead ends: 132 [2024-11-18 17:28:04,468 INFO L226 Difference]: Without dead ends: 80 [2024-11-18 17:28:04,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 17:28:04,469 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:04,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 128 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:28:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-18 17:28:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2024-11-18 17:28:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2024-11-18 17:28:04,475 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 27 [2024-11-18 17:28:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:04,475 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2024-11-18 17:28:04,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-18 17:28:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2024-11-18 17:28:04,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 17:28:04,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:04,477 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:04,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 17:28:04,477 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:04,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:04,478 INFO L85 PathProgramCache]: Analyzing trace with hash 28055547, now seen corresponding path program 1 times [2024-11-18 17:28:04,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:04,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949994299] [2024-11-18 17:28:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:04,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:04,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949994299] [2024-11-18 17:28:04,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949994299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 17:28:04,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719299093] [2024-11-18 17:28:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:04,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:28:04,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:28:04,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 17:28:04,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 17:28:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:04,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-18 17:28:04,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:28:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:05,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 17:28:05,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719299093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:05,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 17:28:05,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-18 17:28:05,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113763087] [2024-11-18 17:28:05,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:05,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 17:28:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:05,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 17:28:05,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-18 17:28:05,014 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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-18 17:28:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:05,123 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2024-11-18 17:28:05,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 17:28:05,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-18 17:28:05,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:05,126 INFO L225 Difference]: With dead ends: 134 [2024-11-18 17:28:05,126 INFO L226 Difference]: Without dead ends: 82 [2024-11-18 17:28:05,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-18 17:28:05,127 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 70 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:05,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 93 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:28:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-18 17:28:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-18 17:28:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.271604938271605) internal successors, (103), 81 states have internal predecessors, (103), 0 states have call successors, (0), 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-18 17:28:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2024-11-18 17:28:05,131 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 41 [2024-11-18 17:28:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:05,132 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2024-11-18 17:28:05,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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-18 17:28:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2024-11-18 17:28:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 17:28:05,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:05,133 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:05,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 17:28:05,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:28:05,335 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:05,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash -937324527, now seen corresponding path program 1 times [2024-11-18 17:28:05,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:05,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486828771] [2024-11-18 17:28:05,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:05,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:05,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:05,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486828771] [2024-11-18 17:28:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486828771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 17:28:05,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097446264] [2024-11-18 17:28:05,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:05,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:28:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:28:05,822 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 17:28:05,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 17:28:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:05,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-18 17:28:05,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:28:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:06,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:28:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:06,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097446264] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:28:06,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 17:28:06,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2024-11-18 17:28:06,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597179672] [2024-11-18 17:28:06,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 17:28:06,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-18 17:28:06,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:06,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-18 17:28:06,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-18 17:28:06,610 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 0 states have call successors, (0), 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-18 17:28:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:06,872 INFO L93 Difference]: Finished difference Result 167 states and 210 transitions. [2024-11-18 17:28:06,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 17:28:06,873 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 0 states have call successors, (0), 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 42 [2024-11-18 17:28:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:06,874 INFO L225 Difference]: With dead ends: 167 [2024-11-18 17:28:06,874 INFO L226 Difference]: Without dead ends: 115 [2024-11-18 17:28:06,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2024-11-18 17:28:06,875 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:06,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 419 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 17:28:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-18 17:28:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 85. [2024-11-18 17:28:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 84 states have internal predecessors, (106), 0 states have call successors, (0), 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-18 17:28:06,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2024-11-18 17:28:06,881 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 42 [2024-11-18 17:28:06,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:06,881 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2024-11-18 17:28:06,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 0 states have call successors, (0), 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-18 17:28:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2024-11-18 17:28:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 17:28:06,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:06,882 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:06,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 17:28:07,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-18 17:28:07,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:07,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:07,085 INFO L85 PathProgramCache]: Analyzing trace with hash 614522583, now seen corresponding path program 1 times [2024-11-18 17:28:07,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:07,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787150543] [2024-11-18 17:28:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:07,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:07,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:07,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787150543] [2024-11-18 17:28:07,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787150543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 17:28:07,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876923195] [2024-11-18 17:28:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:07,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:28:07,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:28:07,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 17:28:07,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 17:28:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:07,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-18 17:28:07,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:28:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:07,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:28:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876923195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:28:08,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 17:28:08,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2024-11-18 17:28:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862487801] [2024-11-18 17:28:08,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 17:28:08,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-18 17:28:08,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:08,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-18 17:28:08,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-18 17:28:08,483 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 0 states have call successors, (0), 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-18 17:28:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:08,811 INFO L93 Difference]: Finished difference Result 149 states and 186 transitions. [2024-11-18 17:28:08,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 17:28:08,812 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 0 states have call successors, (0), 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 44 [2024-11-18 17:28:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:08,813 INFO L225 Difference]: With dead ends: 149 [2024-11-18 17:28:08,813 INFO L226 Difference]: Without dead ends: 97 [2024-11-18 17:28:08,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2024-11-18 17:28:08,814 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 45 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:08,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 425 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 17:28:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-18 17:28:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2024-11-18 17:28:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.255813953488372) internal successors, (108), 86 states have internal predecessors, (108), 0 states have call successors, (0), 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-18 17:28:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2024-11-18 17:28:08,819 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 44 [2024-11-18 17:28:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:08,819 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2024-11-18 17:28:08,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 0 states have call successors, (0), 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-18 17:28:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2024-11-18 17:28:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 17:28:08,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:08,821 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:08,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 17:28:09,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:28:09,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:09,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:09,025 INFO L85 PathProgramCache]: Analyzing trace with hash 830448833, now seen corresponding path program 1 times [2024-11-18 17:28:09,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:09,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412190756] [2024-11-18 17:28:09,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:09,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:10,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:10,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412190756] [2024-11-18 17:28:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412190756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 17:28:10,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413718277] [2024-11-18 17:28:10,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:10,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:28:10,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:28:10,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 17:28:10,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 17:28:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:11,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-18 17:28:11,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:28:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:11,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:28:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:12,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413718277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:28:12,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 17:28:12,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 32 [2024-11-18 17:28:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651154533] [2024-11-18 17:28:12,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 17:28:12,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-18 17:28:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:12,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-18 17:28:12,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2024-11-18 17:28:12,222 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 32 states, 32 states have (on average 4.90625) internal successors, (157), 32 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-18 17:28:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:13,811 INFO L93 Difference]: Finished difference Result 216 states and 269 transitions. [2024-11-18 17:28:13,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-18 17:28:13,811 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.90625) internal successors, (157), 32 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) Word has length 58 [2024-11-18 17:28:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:13,812 INFO L225 Difference]: With dead ends: 216 [2024-11-18 17:28:13,812 INFO L226 Difference]: Without dead ends: 164 [2024-11-18 17:28:13,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=539, Invalid=3367, Unknown=0, NotChecked=0, Total=3906 [2024-11-18 17:28:13,813 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 229 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:13,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1038 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 17:28:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-18 17:28:13,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 82. [2024-11-18 17:28:13,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 81 states have internal predecessors, (100), 0 states have call successors, (0), 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-18 17:28:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2024-11-18 17:28:13,821 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 58 [2024-11-18 17:28:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:13,822 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2024-11-18 17:28:13,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.90625) internal successors, (157), 32 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-18 17:28:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2024-11-18 17:28:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-18 17:28:13,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:13,822 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:13,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 17:28:14,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:28:14,023 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:14,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1088303345, now seen corresponding path program 1 times [2024-11-18 17:28:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:14,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47311218] [2024-11-18 17:28:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:14,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-18 17:28:14,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:14,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47311218] [2024-11-18 17:28:14,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47311218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 17:28:14,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871145271] [2024-11-18 17:28:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:14,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:28:14,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:28:14,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 17:28:14,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 17:28:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:14,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-18 17:28:14,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:28:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 17:28:14,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:28:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 17:28:15,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871145271] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:28:15,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 17:28:15,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 11] total 21 [2024-11-18 17:28:15,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386098835] [2024-11-18 17:28:15,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 17:28:15,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 17:28:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:15,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 17:28:15,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2024-11-18 17:28:15,550 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 0 states have call successors, (0), 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-18 17:28:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:15,993 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2024-11-18 17:28:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-18 17:28:15,993 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 0 states have call successors, (0), 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 59 [2024-11-18 17:28:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:15,994 INFO L225 Difference]: With dead ends: 181 [2024-11-18 17:28:15,994 INFO L226 Difference]: Without dead ends: 134 [2024-11-18 17:28:15,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2024-11-18 17:28:15,995 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 52 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:15,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 422 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 17:28:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-18 17:28:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 85. [2024-11-18 17:28:15,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 84 states have internal predecessors, (102), 0 states have call successors, (0), 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-18 17:28:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2024-11-18 17:28:15,999 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 59 [2024-11-18 17:28:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:16,000 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2024-11-18 17:28:16,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 0 states have call successors, (0), 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-18 17:28:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2024-11-18 17:28:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-18 17:28:16,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:16,001 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:16,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 17:28:16,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-18 17:28:16,206 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:16,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1362327673, now seen corresponding path program 1 times [2024-11-18 17:28:16,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:16,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933734642] [2024-11-18 17:28:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:17,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:17,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933734642] [2024-11-18 17:28:17,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933734642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 17:28:17,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112652077] [2024-11-18 17:28:17,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:17,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:28:17,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:28:17,496 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 17:28:17,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 17:28:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:17,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-18 17:28:17,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:28:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:18,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:28:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:28:18,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112652077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:28:18,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 17:28:18,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 31 [2024-11-18 17:28:18,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458458492] [2024-11-18 17:28:18,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 17:28:18,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-18 17:28:18,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:18,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-18 17:28:18,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-18 17:28:18,801 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand has 31 states, 31 states have (on average 4.838709677419355) internal successors, (150), 31 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-18 17:28:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:19,353 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2024-11-18 17:28:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 17:28:19,354 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.838709677419355) internal successors, (150), 31 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) Word has length 60 [2024-11-18 17:28:19,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:19,354 INFO L225 Difference]: With dead ends: 138 [2024-11-18 17:28:19,354 INFO L226 Difference]: Without dead ends: 88 [2024-11-18 17:28:19,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=405, Invalid=1665, Unknown=0, NotChecked=0, Total=2070 [2024-11-18 17:28:19,355 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 245 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:19,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 608 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 17:28:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-18 17:28:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2024-11-18 17:28:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2024-11-18 17:28:19,358 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 60 [2024-11-18 17:28:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:19,358 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2024-11-18 17:28:19,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.838709677419355) internal successors, (150), 31 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-18 17:28:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2024-11-18 17:28:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-18 17:28:19,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:19,359 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:19,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 17:28:19,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:28:19,563 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:19,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash -302988283, now seen corresponding path program 1 times [2024-11-18 17:28:19,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:19,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772147035] [2024-11-18 17:28:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:19,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 17:28:19,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 17:28:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 17:28:19,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 17:28:19,751 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 17:28:19,752 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 17:28:19,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-18 17:28:19,756 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:19,808 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 17:28:19,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:28:19 BoogieIcfgContainer [2024-11-18 17:28:19,812 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 17:28:19,813 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 17:28:19,813 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 17:28:19,813 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 17:28:19,814 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:28:00" (3/4) ... [2024-11-18 17:28:19,815 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 17:28:19,816 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 17:28:19,817 INFO L158 Benchmark]: Toolchain (without parser) took 20109.47ms. Allocated memory was 161.5MB in the beginning and 585.1MB in the end (delta: 423.6MB). Free memory was 90.7MB in the beginning and 486.7MB in the end (delta: -396.0MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-18 17:28:19,817 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 17:28:19,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.28ms. Allocated memory is still 161.5MB. Free memory was 90.4MB in the beginning and 75.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 17:28:19,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.10ms. Allocated memory was 161.5MB in the beginning and 255.9MB in the end (delta: 94.4MB). Free memory was 75.8MB in the beginning and 225.1MB in the end (delta: -149.3MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-18 17:28:19,818 INFO L158 Benchmark]: Boogie Preprocessor took 72.07ms. Allocated memory is still 255.9MB. Free memory was 225.1MB in the beginning and 222.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 17:28:19,818 INFO L158 Benchmark]: RCFGBuilder took 601.44ms. Allocated memory is still 255.9MB. Free memory was 222.2MB in the beginning and 194.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-18 17:28:19,818 INFO L158 Benchmark]: TraceAbstraction took 19026.97ms. Allocated memory was 255.9MB in the beginning and 585.1MB in the end (delta: 329.3MB). Free memory was 193.9MB in the beginning and 486.7MB in the end (delta: -292.8MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2024-11-18 17:28:19,819 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 585.1MB. Free memory is still 486.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 17:28:19,820 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.28ms. Allocated memory is still 161.5MB. Free memory was 90.4MB in the beginning and 75.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.10ms. Allocated memory was 161.5MB in the beginning and 255.9MB in the end (delta: 94.4MB). Free memory was 75.8MB in the beginning and 225.1MB in the end (delta: -149.3MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.07ms. Allocated memory is still 255.9MB. Free memory was 225.1MB in the beginning and 222.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 601.44ms. Allocated memory is still 255.9MB. Free memory was 222.2MB in the beginning and 194.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 19026.97ms. Allocated memory was 255.9MB in the beginning and 585.1MB in the end (delta: 329.3MB). Free memory was 193.9MB in the beginning and 486.7MB in the end (delta: -292.8MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 585.1MB. Free memory is still 486.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 97. 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_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 32); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (32 - 1); [L35] const SORT_4 var_8 = 0; [L36] const SORT_12 var_14 = 1; [L37] const SORT_1 var_25 = 1; [L38] const SORT_1 var_42 = 0; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L42] SORT_4 input_5; [L43] SORT_1 input_6; [L44] SORT_1 input_7; [L45] SORT_4 input_29; [L46] SORT_4 input_31; [L47] SORT_4 input_33; [L48] SORT_4 input_35; [L49] SORT_4 input_37; [L50] SORT_4 input_39; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=255, var_14=1, var_25=1, var_42=0, var_8=0] [L52] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, var_14=1, var_25=1, var_42=0, var_8=0] [L53] SORT_4 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_14=1, var_25=1, var_42=0, var_8=0] [L54] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] SORT_4 init_10_arg_1 = var_8; [L57] state_9 = init_10_arg_1 [L58] SORT_4 init_18_arg_1 = var_8; [L59] state_17 = init_18_arg_1 [L60] SORT_1 init_44_arg_1 = var_42; [L61] state_43 = init_44_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_13_arg_0=0, var_14=1, var_25=1, var_42=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_16=-1, var_20_arg_0=0, var_25=1, var_42=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_16=-1, var_25=1, var_42=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_22_arg_0=-1, var_22_arg_1=0, var_25=1, var_42=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_27_arg_0=1, var_27_arg_1=-256, var_42=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_28_arg_0)) [L107] SORT_1 var_45_arg_0 = state_43; [L108] SORT_4 var_45_arg_1 = input_5; [L109] SORT_4 var_45_arg_2 = state_9; [L110] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L111] SORT_4 next_46_arg_1 = var_45; [L112] SORT_1 var_47_arg_0 = state_43; [L113] SORT_4 var_47_arg_1 = input_5; [L114] SORT_4 var_47_arg_2 = state_17; [L115] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L116] SORT_4 next_48_arg_1 = var_47; [L117] SORT_1 var_49_arg_0 = state_43; [L118] SORT_1 var_49_arg_1 = var_42; [L119] SORT_1 var_49_arg_2 = var_25; [L120] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; VAL [mask_SORT_1=1, next_46_arg_1=0, next_48_arg_1=0, var_14=1, var_25=1, var_42=0, var_49=1] [L121] EXPR var_49 & mask_SORT_1 VAL [mask_SORT_1=1, next_46_arg_1=0, next_48_arg_1=0, var_14=1, var_25=1, var_42=0] [L121] var_49 = var_49 & mask_SORT_1 [L122] SORT_1 next_50_arg_1 = var_49; [L124] state_9 = next_46_arg_1 [L125] state_17 = next_48_arg_1 [L126] state_43 = next_50_arg_1 [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_13_arg_0=0, var_14=1, var_25=1, var_42=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_16=-1, var_20_arg_0=0, var_25=1, var_42=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_16=-1, var_25=1, var_42=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_22_arg_0=-1, var_22_arg_1=0, var_25=1, var_42=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_27_arg_0=1, var_27_arg_1=-256, var_42=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_28_arg_0)) [L107] SORT_1 var_45_arg_0 = state_43; [L108] SORT_4 var_45_arg_1 = input_5; [L109] SORT_4 var_45_arg_2 = state_9; [L110] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L111] SORT_4 next_46_arg_1 = var_45; [L112] SORT_1 var_47_arg_0 = state_43; [L113] SORT_4 var_47_arg_1 = input_5; [L114] SORT_4 var_47_arg_2 = state_17; [L115] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L116] SORT_4 next_48_arg_1 = var_47; [L117] SORT_1 var_49_arg_0 = state_43; [L118] SORT_1 var_49_arg_1 = var_42; [L119] SORT_1 var_49_arg_2 = var_25; [L120] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; VAL [mask_SORT_1=1, next_46_arg_1=255, next_48_arg_1=255, var_14=1, var_25=1, var_42=0, var_49=0] [L121] EXPR var_49 & mask_SORT_1 VAL [mask_SORT_1=1, next_46_arg_1=255, next_48_arg_1=255, var_14=1, var_25=1, var_42=0] [L121] var_49 = var_49 & mask_SORT_1 [L122] SORT_1 next_50_arg_1 = var_49; [L124] state_9 = next_46_arg_1 [L125] state_17 = next_48_arg_1 [L126] state_43 = next_50_arg_1 [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_13_arg_0=1, var_14=1, var_25=1, var_42=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_16=-2, var_20_arg_0=1, var_25=1, var_42=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_16=-2, var_25=1, var_42=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_22_arg_0=-2, var_22_arg_1=1, var_25=1, var_42=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_27_arg_0=1, var_27_arg_1=-255, var_42=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 981 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 981 mSDsluCounter, 4579 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3906 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3416 IncrementalHoareTripleChecker+Invalid, 3455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 673 mSDtfsCounter, 3416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 529 SyntacticMatches, 3 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=11, InterpolantAutomatonStates: 138, 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, 14 MinimizatonAttempts, 227 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 861 NumberOfCodeBlocks, 861 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 8798 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2098 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 25 InterpolantComputations, 9 PerfectInterpolantSequences, 344/482 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-18 17:28:19,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.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 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 17:28:22,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 17:28:22,087 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-18 17:28:22,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 17:28:22,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 17:28:22,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 17:28:22,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 17:28:22,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 17:28:22,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 17:28:22,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 17:28:22,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 17:28:22,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 17:28:22,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 17:28:22,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 17:28:22,126 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 17:28:22,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 17:28:22,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 17:28:22,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 17:28:22,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 17:28:22,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 17:28:22,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 17:28:22,132 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 17:28:22,133 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 17:28:22,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 17:28:22,133 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 17:28:22,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 17:28:22,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 17:28:22,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 17:28:22,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 17:28:22,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 17:28:22,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 17:28:22,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:28:22,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 17:28:22,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 17:28:22,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 17:28:22,135 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 17:28:22,135 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 17:28:22,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 17:28:22,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 17:28:22,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 17:28:22,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 17:28:22,136 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 -> 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e [2024-11-18 17:28:22,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 17:28:22,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 17:28:22,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 17:28:22,472 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 17:28:22,472 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 17:28:22,473 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_b04.c [2024-11-18 17:28:24,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 17:28:24,401 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 17:28:24,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2024-11-18 17:28:24,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7fb02a89/a16128c728c04c6089e0b3f973807057/FLAG7258db1e2 [2024-11-18 17:28:24,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7fb02a89/a16128c728c04c6089e0b3f973807057 [2024-11-18 17:28:24,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 17:28:24,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 17:28:24,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 17:28:24,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 17:28:24,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 17:28:24,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a018ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24, skipping insertion in model container [2024-11-18 17:28:24,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 17:28:24,604 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_b04.c[1245,1258] [2024-11-18 17:28:24,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:28:24,660 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 17:28:24,672 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_b04.c[1245,1258] [2024-11-18 17:28:24,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:28:24,734 INFO L204 MainTranslator]: Completed translation [2024-11-18 17:28:24,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24 WrapperNode [2024-11-18 17:28:24,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 17:28:24,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 17:28:24,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 17:28:24,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 17:28:24,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,776 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-11-18 17:28:24,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 17:28:24,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 17:28:24,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 17:28:24,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 17:28:24,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,816 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-18 17:28:24,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 17:28:24,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 17:28:24,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 17:28:24,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 17:28:24,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (1/1) ... [2024-11-18 17:28:24,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:28:24,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:28:24,881 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-18 17:28:24,889 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-18 17:28:24,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 17:28:24,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 17:28:24,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-18 17:28:24,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 17:28:24,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 17:28:25,026 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 17:28:25,028 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 17:28:25,148 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-18 17:28:25,149 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 17:28:25,157 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 17:28:25,157 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 17:28:25,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:28:25 BoogieIcfgContainer [2024-11-18 17:28:25,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 17:28:25,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 17:28:25,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 17:28:25,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 17:28:25,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:28:24" (1/3) ... [2024-11-18 17:28:25,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ee1232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:28:25, skipping insertion in model container [2024-11-18 17:28:25,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:24" (2/3) ... [2024-11-18 17:28:25,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ee1232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:28:25, skipping insertion in model container [2024-11-18 17:28:25,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:28:25" (3/3) ... [2024-11-18 17:28:25,164 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b04.c [2024-11-18 17:28:25,177 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 17:28:25,178 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 17:28:25,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 17:28:25,234 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;@4c7d82f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 17:28:25,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 17:28:25,237 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-18 17:28:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-18 17:28:25,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:25,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-18 17:28:25,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:25,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-18 17:28:25,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:28:25,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784139346] [2024-11-18 17:28:25,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:25,259 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-18 17:28:25,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:28:25,264 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-18 17:28:25,265 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-18 17:28:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:25,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-18 17:28:25,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:28:25,624 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-18 17:28:25,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 17:28:25,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:28:25,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784139346] [2024-11-18 17:28:25,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784139346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:25,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:25,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:28:25,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308801699] [2024-11-18 17:28:25,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:25,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:28:25,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:28:25,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:28:25,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:28:25,659 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-18 17:28:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:25,709 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-18 17:28:25,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:28:25,715 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-18 17:28:25,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:25,721 INFO L225 Difference]: With dead ends: 18 [2024-11-18 17:28:25,721 INFO L226 Difference]: Without dead ends: 10 [2024-11-18 17:28:25,723 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-18 17:28:25,727 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-18 17:28:25,727 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-18 17:28:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-18 17:28:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-18 17:28:25,750 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-18 17:28:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-18 17:28:25,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-18 17:28:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:25,752 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-18 17:28:25,753 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-18 17:28:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-18 17:28:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-18 17:28:25,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:25,754 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:25,758 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-18 17:28:25,954 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-18 17:28:25,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:25,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:25,956 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-18 17:28:25,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:28:25,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658161593] [2024-11-18 17:28:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:25,957 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-18 17:28:25,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:28:25,963 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-18 17:28:25,965 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-18 17:28:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:26,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-18 17:28:26,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:28:26,372 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-18 17:28:26,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:28:26,701 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-18 17:28:26,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:28:26,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658161593] [2024-11-18 17:28:26,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658161593] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:28:26,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 17:28:26,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-18 17:28:26,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037454148] [2024-11-18 17:28:26,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 17:28:26,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 17:28:26,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:28:26,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 17:28:26,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-18 17:28:26,704 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-18 17:28:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:26,755 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-18 17:28:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 17:28:26,756 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-18 17:28:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:26,756 INFO L225 Difference]: With dead ends: 15 [2024-11-18 17:28:26,756 INFO L226 Difference]: Without dead ends: 13 [2024-11-18 17:28:26,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-18 17:28:26,757 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 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-18 17:28:26,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:28:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-18 17:28:26,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-18 17:28:26,760 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-18 17:28:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-18 17:28:26,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-18 17:28:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:26,761 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-18 17:28:26,761 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-18 17:28:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-18 17:28:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-18 17:28:26,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:26,761 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-18 17:28:26,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-18 17:28:26,962 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-18 17:28:26,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:26,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:26,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-18 17:28:26,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:28:26,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692642922] [2024-11-18 17:28:26,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 17:28:26,967 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-18 17:28:26,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:28:26,972 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-18 17:28:26,981 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-18 17:28:27,144 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 17:28:27,144 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:28:27,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-18 17:28:27,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:28:27,460 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-18 17:28:27,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:28:27,884 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-18 17:28:27,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:28:27,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692642922] [2024-11-18 17:28:27,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692642922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:28:27,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 17:28:27,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-18 17:28:27,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546051572] [2024-11-18 17:28:27,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 17:28:27,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 17:28:27,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:28:27,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 17:28:27,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-18 17:28:27,888 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:28,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:28,023 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-11-18 17:28:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 17:28:28,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-18 17:28:28,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:28,025 INFO L225 Difference]: With dead ends: 13 [2024-11-18 17:28:28,025 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 17:28:28,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-18 17:28:28,026 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:28,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:28:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 17:28:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 17:28:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-18 17:28:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 17:28:28,028 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2024-11-18 17:28:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:28,028 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 17:28:28,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:28:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 17:28:28,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 17:28:28,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 17:28:28,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-18 17:28:28,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-18 17:28:28,240 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-18 17:28:28,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 17:28:28,315 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 17:28:28,338 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 17:28:28,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:28:28 BoogieIcfgContainer [2024-11-18 17:28:28,350 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 17:28:28,351 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 17:28:28,351 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 17:28:28,351 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 17:28:28,352 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:28:25" (3/4) ... [2024-11-18 17:28:28,354 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 17:28:28,378 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-18 17:28:28,379 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-18 17:28:28,379 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 17:28:28,379 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 17:28:28,380 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 17:28:28,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 17:28:28,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 17:28:28,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 17:28:28,463 INFO L158 Benchmark]: Toolchain (without parser) took 4039.68ms. Allocated memory was 92.3MB in the beginning and 195.0MB in the end (delta: 102.8MB). Free memory was 56.9MB in the beginning and 88.6MB in the end (delta: -31.7MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2024-11-18 17:28:28,463 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 73.9MB in the beginning and 73.7MB in the end (delta: 127.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 17:28:28,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.33ms. Allocated memory is still 92.3MB. Free memory was 56.6MB in the beginning and 70.8MB in the end (delta: -14.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-18 17:28:28,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.72ms. Allocated memory is still 92.3MB. Free memory was 70.8MB in the beginning and 68.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 17:28:28,464 INFO L158 Benchmark]: Boogie Preprocessor took 65.49ms. Allocated memory is still 92.3MB. Free memory was 68.9MB in the beginning and 66.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 17:28:28,464 INFO L158 Benchmark]: RCFGBuilder took 312.33ms. Allocated memory is still 92.3MB. Free memory was 66.4MB in the beginning and 50.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 17:28:28,464 INFO L158 Benchmark]: TraceAbstraction took 3191.11ms. Allocated memory was 92.3MB in the beginning and 195.0MB in the end (delta: 102.8MB). Free memory was 50.0MB in the beginning and 94.8MB in the end (delta: -44.8MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2024-11-18 17:28:28,464 INFO L158 Benchmark]: Witness Printer took 111.55ms. Allocated memory is still 195.0MB. Free memory was 94.8MB in the beginning and 88.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 17:28:28,466 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.19ms. Allocated memory is still 92.3MB. Free memory was 73.9MB in the beginning and 73.7MB in the end (delta: 127.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.33ms. Allocated memory is still 92.3MB. Free memory was 56.6MB in the beginning and 70.8MB in the end (delta: -14.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.72ms. Allocated memory is still 92.3MB. Free memory was 70.8MB in the beginning and 68.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.49ms. Allocated memory is still 92.3MB. Free memory was 68.9MB in the beginning and 66.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 312.33ms. Allocated memory is still 92.3MB. Free memory was 66.4MB in the beginning and 50.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3191.11ms. Allocated memory was 92.3MB in the beginning and 195.0MB in the end (delta: 102.8MB). Free memory was 50.0MB in the beginning and 94.8MB in the end (delta: -44.8MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * Witness Printer took 111.55ms. Allocated memory is still 195.0MB. Free memory was 94.8MB in the beginning and 88.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 10 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 12 QuantifiedInterpolants, 845 SizeOfPredicates, 17 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((1 == var_14) && (1 == mask_SORT_1)) RESULT: Ultimate proved your program to be correct! [2024-11-18 17:28:28,507 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 Writing output log to file Ultimate.log Result: TRUE