./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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-wip.fs.cvc5-61a6796-m [2024-10-14 06:21:29,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:21:29,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 06:21:29,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:21:29,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:21:29,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:21:29,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:21:29,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:21:29,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:21:29,896 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:21:29,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:21:29,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:21:29,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:21:29,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:21:29,898 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:21:29,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:21:29,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:21:29,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 06:21:29,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:21:29,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:21:29,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:21:29,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:21:29,902 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:21:29,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:21:29,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:21:29,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:21:29,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:21:29,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:21:29,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:21:29,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:21:29,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:21:29,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:21:29,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:21:29,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 06:21:29,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 06:21:29,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:21:29,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:21:29,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:21:29,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:21:29,907 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-10-14 06:21:30,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:21:30,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:21:30,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:21:30,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:21:30,188 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:21:30,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2024-10-14 06:21:31,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:21:31,864 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:21:31,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2024-10-14 06:21:31,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99421cf41/80da3a5e0a0944f7a8b1aa4c3313666a/FLAG8117a8d14 [2024-10-14 06:21:31,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99421cf41/80da3a5e0a0944f7a8b1aa4c3313666a [2024-10-14 06:21:31,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:21:31,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:21:31,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:21:31,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:21:31,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:21:31,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:21:31" (1/1) ... [2024-10-14 06:21:31,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f56da53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:31, skipping insertion in model container [2024-10-14 06:21:31,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:21:31" (1/1) ... [2024-10-14 06:21:31,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:21:32,092 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c[1245,1258] [2024-10-14 06:21:32,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:21:32,171 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:21:32,183 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c[1245,1258] [2024-10-14 06:21:32,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:21:32,227 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:21:32,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32 WrapperNode [2024-10-14 06:21:32,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:21:32,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:21:32,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:21:32,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:21:32,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (1/1) ... [2024-10-14 06:21:32,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (1/1) ... [2024-10-14 06:21:32,322 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 216 [2024-10-14 06:21:32,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:21:32,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:21:32,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:21:32,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:21:32,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (1/1) ... [2024-10-14 06:21:32,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (1/1) ... [2024-10-14 06:21:32,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (1/1) ... [2024-10-14 06:21:32,376 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-14 06:21:32,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (1/1) ... [2024-10-14 06:21:32,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (1/1) ... [2024-10-14 06:21:32,386 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (1/1) ... [2024-10-14 06:21:32,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (1/1) ... [2024-10-14 06:21:32,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (1/1) ... [2024-10-14 06:21:32,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (1/1) ... [2024-10-14 06:21:32,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:21:32,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:21:32,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:21:32,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:21:32,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (1/1) ... [2024-10-14 06:21:32,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:21:32,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:21:32,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 06:21:32,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 06:21:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:21:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 06:21:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 06:21:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:21:32,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:21:32,600 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:21:32,602 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:21:32,973 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-10-14 06:21:32,973 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:21:33,016 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:21:33,017 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:21:33,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:21:33 BoogieIcfgContainer [2024-10-14 06:21:33,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:21:33,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:21:33,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:21:33,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:21:33,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:21:31" (1/3) ... [2024-10-14 06:21:33,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337a2fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:21:33, skipping insertion in model container [2024-10-14 06:21:33,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:32" (2/3) ... [2024-10-14 06:21:33,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337a2fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:21:33, skipping insertion in model container [2024-10-14 06:21:33,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:21:33" (3/3) ... [2024-10-14 06:21:33,031 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b04.c [2024-10-14 06:21:33,048 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:21:33,049 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:21:33,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:21:33,115 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;@3d634a26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:21:33,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:21:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 42 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 06:21:33,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:33,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:21:33,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:33,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:33,138 INFO L85 PathProgramCache]: Analyzing trace with hash -495221930, now seen corresponding path program 1 times [2024-10-14 06:21:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:33,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507569104] [2024-10-14 06:21:33,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:33,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:33,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507569104] [2024-10-14 06:21:33,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507569104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:21:33,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:21:33,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:21:33,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869164733] [2024-10-14 06:21:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:21:33,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:21:33,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:33,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:21:33,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:21:33,861 INFO L87 Difference]: Start difference. First operand has 43 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 42 states have internal predecessors, (62), 0 states have call successors, (0), 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.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:33,913 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2024-10-14 06:21:33,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:21:33,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-14 06:21:33,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:33,924 INFO L225 Difference]: With dead ends: 74 [2024-10-14 06:21:33,924 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 06:21:33,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:21:33,932 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:33,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:21:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 06:21:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-14 06:21:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2024-10-14 06:21:33,973 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 20 [2024-10-14 06:21:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:33,974 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2024-10-14 06:21:33,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2024-10-14 06:21:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 06:21:33,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:33,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:21:33,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 06:21:33,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:33,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:33,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1829684611, now seen corresponding path program 1 times [2024-10-14 06:21:33,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:33,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478315788] [2024-10-14 06:21:33,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:33,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:34,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:34,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478315788] [2024-10-14 06:21:34,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478315788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:21:34,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:21:34,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:21:34,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618457887] [2024-10-14 06:21:34,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:21:34,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:21:34,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:34,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:21:34,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:21:34,192 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. 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-10-14 06:21:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:34,227 INFO L93 Difference]: Finished difference Result 77 states and 108 transitions. [2024-10-14 06:21:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:21:34,228 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-10-14 06:21:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:34,229 INFO L225 Difference]: With dead ends: 77 [2024-10-14 06:21:34,229 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 06:21:34,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:21:34,233 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:34,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:21:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 06:21:34,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 06:21:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 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-10-14 06:21:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-10-14 06:21:34,242 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 21 [2024-10-14 06:21:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:34,243 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-10-14 06:21:34,243 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-10-14 06:21:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-10-14 06:21:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 06:21:34,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:34,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:21:34,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 06:21:34,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:34,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash -212317745, now seen corresponding path program 1 times [2024-10-14 06:21:34,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:34,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301081226] [2024-10-14 06:21:34,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:34,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:34,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:34,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301081226] [2024-10-14 06:21:34,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301081226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:21:34,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:21:34,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:21:34,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281354576] [2024-10-14 06:21:34,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:21:34,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:21:34,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:34,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:21:34,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:21:34,647 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:34,686 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2024-10-14 06:21:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:21:34,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-14 06:21:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:34,687 INFO L225 Difference]: With dead ends: 79 [2024-10-14 06:21:34,688 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 06:21:34,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:21:34,691 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:34,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 151 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:21:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 06:21:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 06:21:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4) internal successors, (63), 45 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-10-14 06:21:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-10-14 06:21:34,701 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 22 [2024-10-14 06:21:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:34,702 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-10-14 06:21:34,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-10-14 06:21:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 06:21:34,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:34,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:21:34,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 06:21:34,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:34,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:34,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1377995894, now seen corresponding path program 1 times [2024-10-14 06:21:34,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:34,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142899235] [2024-10-14 06:21:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:34,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:35,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:35,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142899235] [2024-10-14 06:21:35,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142899235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:21:35,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:21:35,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 06:21:35,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533415802] [2024-10-14 06:21:35,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:21:35,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:21:35,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:35,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:21:35,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:21:35,127 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:35,254 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2024-10-14 06:21:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 06:21:35,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 06:21:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:35,256 INFO L225 Difference]: With dead ends: 89 [2024-10-14 06:21:35,256 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 06:21:35,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-14 06:21:35,257 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 68 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:35,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 296 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:21:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 06:21:35,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-10-14 06:21:35,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-10-14 06:21:35,263 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 23 [2024-10-14 06:21:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:35,263 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-10-14 06:21:35,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-10-14 06:21:35,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 06:21:35,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:35,264 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-10-14 06:21:35,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 06:21:35,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:35,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:35,266 INFO L85 PathProgramCache]: Analyzing trace with hash 551146636, now seen corresponding path program 1 times [2024-10-14 06:21:35,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:35,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104770375] [2024-10-14 06:21:35,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:35,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:35,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:35,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104770375] [2024-10-14 06:21:35,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104770375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:21:35,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:21:35,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:21:35,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535255493] [2024-10-14 06:21:35,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:21:35,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:21:35,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:35,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:21:35,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:21:35,598 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 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-10-14 06:21:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:35,653 INFO L93 Difference]: Finished difference Result 103 states and 139 transitions. [2024-10-14 06:21:35,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:21:35,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 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-10-14 06:21:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:35,655 INFO L225 Difference]: With dead ends: 103 [2024-10-14 06:21:35,655 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 06:21:35,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:21:35,657 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:35,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 156 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:21:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 06:21:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-14 06:21:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2024-10-14 06:21:35,668 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 24 [2024-10-14 06:21:35,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:35,670 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2024-10-14 06:21:35,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 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-10-14 06:21:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2024-10-14 06:21:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 06:21:35,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:35,671 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-10-14 06:21:35,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 06:21:35,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:35,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1076941601, now seen corresponding path program 1 times [2024-10-14 06:21:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:35,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348828681] [2024-10-14 06:21:35,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:35,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:35,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:35,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348828681] [2024-10-14 06:21:35,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348828681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:21:35,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:21:35,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:21:35,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554523900] [2024-10-14 06:21:35,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:21:35,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:21:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:35,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:21:35,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:21:35,877 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 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-10-14 06:21:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:35,990 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2024-10-14 06:21:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:21:35,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 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-10-14 06:21:35,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:35,991 INFO L225 Difference]: With dead ends: 141 [2024-10-14 06:21:35,994 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 06:21:35,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:21:35,995 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:35,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 115 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:21:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 06:21:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2024-10-14 06:21:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2024-10-14 06:21:36,007 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 24 [2024-10-14 06:21:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:36,007 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2024-10-14 06:21:36,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 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-10-14 06:21:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2024-10-14 06:21:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 06:21:36,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:36,008 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-10-14 06:21:36,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 06:21:36,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:36,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:36,009 INFO L85 PathProgramCache]: Analyzing trace with hash -904526706, now seen corresponding path program 1 times [2024-10-14 06:21:36,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:36,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316608136] [2024-10-14 06:21:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:36,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:36,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316608136] [2024-10-14 06:21:36,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316608136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:21:36,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:21:36,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:21:36,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212244379] [2024-10-14 06:21:36,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:21:36,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:21:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:36,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:21:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:21:36,219 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 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-10-14 06:21:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:36,309 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2024-10-14 06:21:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:21:36,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 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-10-14 06:21:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:36,310 INFO L225 Difference]: With dead ends: 123 [2024-10-14 06:21:36,311 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 06:21:36,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:21:36,313 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:36,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 123 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:21:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 06:21:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2024-10-14 06:21:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2024-10-14 06:21:36,325 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 25 [2024-10-14 06:21:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:36,326 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2024-10-14 06:21:36,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 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-10-14 06:21:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2024-10-14 06:21:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 06:21:36,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:36,329 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] [2024-10-14 06:21:36,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 06:21:36,329 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:36,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:36,330 INFO L85 PathProgramCache]: Analyzing trace with hash 726058961, now seen corresponding path program 1 times [2024-10-14 06:21:36,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:36,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705465476] [2024-10-14 06:21:36,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:36,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:36,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:36,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705465476] [2024-10-14 06:21:36,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705465476] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:21:36,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788112377] [2024-10-14 06:21:36,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:36,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:21:36,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:21:36,724 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-10-14 06:21:36,725 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-10-14 06:21:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:36,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-14 06:21:36,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:21:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:37,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:21:37,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788112377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:21:37,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 06:21:37,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-14 06:21:37,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201310568] [2024-10-14 06:21:37,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:21:37,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:21:37,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:37,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:21:37,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 06:21:37,095 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:37,206 INFO L93 Difference]: Finished difference Result 125 states and 161 transitions. [2024-10-14 06:21:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:21:37,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-14 06:21:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:37,209 INFO L225 Difference]: With dead ends: 125 [2024-10-14 06:21:37,210 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 06:21:37,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 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-10-14 06:21:37,212 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:37,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 88 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:21:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 06:21:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-14 06:21:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2024-10-14 06:21:37,222 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 40 [2024-10-14 06:21:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:37,223 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2024-10-14 06:21:37,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2024-10-14 06:21:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 06:21:37,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:37,224 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-10-14 06:21:37,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 06:21:37,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:21:37,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:37,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash -774055173, now seen corresponding path program 1 times [2024-10-14 06:21:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:37,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776599003] [2024-10-14 06:21:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:37,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:37,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776599003] [2024-10-14 06:21:37,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776599003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:21:37,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108611724] [2024-10-14 06:21:37,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:37,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:21:37,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:21:37,969 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-10-14 06:21:37,971 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-10-14 06:21:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:38,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 06:21:38,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:21:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:38,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:21:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:38,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108611724] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:21:38,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 06:21:38,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2024-10-14 06:21:38,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968325015] [2024-10-14 06:21:38,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 06:21:38,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 06:21:38,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:38,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 06:21:38,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-14 06:21:38,715 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 19 states, 19 states have (on average 5.0) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:39,019 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2024-10-14 06:21:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 06:21:39,020 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 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-10-14 06:21:39,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:39,021 INFO L225 Difference]: With dead ends: 158 [2024-10-14 06:21:39,022 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 06:21:39,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 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-10-14 06:21:39,024 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 70 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:39,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 373 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 06:21:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 06:21:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2024-10-14 06:21:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 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-10-14 06:21:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2024-10-14 06:21:39,035 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 41 [2024-10-14 06:21:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:39,036 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2024-10-14 06:21:39,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2024-10-14 06:21:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 06:21:39,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:39,037 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] [2024-10-14 06:21:39,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 06:21:39,238 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,SelfDestructingSolverStorable8 [2024-10-14 06:21:39,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:39,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:39,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1844115444, now seen corresponding path program 1 times [2024-10-14 06:21:39,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:39,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957288761] [2024-10-14 06:21:39,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:39,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 06:21:39,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:39,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957288761] [2024-10-14 06:21:39,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957288761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:21:39,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081547875] [2024-10-14 06:21:39,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:39,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:21:39,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:21:39,970 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-10-14 06:21:39,972 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-10-14 06:21:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:40,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-14 06:21:40,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:21:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 06:21:40,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:21:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:42,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081547875] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:21:42,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 06:21:42,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 28 [2024-10-14 06:21:42,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157714888] [2024-10-14 06:21:42,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 06:21:42,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 06:21:42,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:42,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 06:21:42,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2024-10-14 06:21:42,268 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 29 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 28 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:42,821 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2024-10-14 06:21:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 06:21:42,821 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 28 states have internal predecessors, (112), 0 states have call successors, (0), 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-10-14 06:21:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:42,822 INFO L225 Difference]: With dead ends: 133 [2024-10-14 06:21:42,822 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 06:21:42,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2024-10-14 06:21:42,823 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 140 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:42,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 241 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 06:21:42,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 06:21:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-10-14 06:21:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2024-10-14 06:21:42,837 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 42 [2024-10-14 06:21:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:42,837 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2024-10-14 06:21:42,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 28 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2024-10-14 06:21:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 06:21:42,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:42,838 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] [2024-10-14 06:21:42,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 06:21:43,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:21:43,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:43,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:43,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1397418175, now seen corresponding path program 1 times [2024-10-14 06:21:43,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:43,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297121744] [2024-10-14 06:21:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:43,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:43,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:43,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297121744] [2024-10-14 06:21:43,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297121744] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:21:43,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41556867] [2024-10-14 06:21:43,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:43,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:21:43,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:21:43,504 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-10-14 06:21:43,506 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-10-14 06:21:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:43,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-14 06:21:43,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:21:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:43,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:21:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:44,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41556867] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:21:44,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 06:21:44,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2024-10-14 06:21:44,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361438096] [2024-10-14 06:21:44,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 06:21:44,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 06:21:44,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:44,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 06:21:44,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-14 06:21:44,459 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:44,687 INFO L93 Difference]: Finished difference Result 148 states and 185 transitions. [2024-10-14 06:21:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 06:21:44,688 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-14 06:21:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:44,689 INFO L225 Difference]: With dead ends: 148 [2024-10-14 06:21:44,689 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 06:21:44,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-10-14 06:21:44,690 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 35 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:44,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 247 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 06:21:44,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 06:21:44,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2024-10-14 06:21:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2024-10-14 06:21:44,702 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 43 [2024-10-14 06:21:44,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:44,702 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2024-10-14 06:21:44,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:44,703 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2024-10-14 06:21:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 06:21:44,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:44,705 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] [2024-10-14 06:21:44,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 06:21:44,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:21:44,906 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:44,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash 984341419, now seen corresponding path program 1 times [2024-10-14 06:21:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:44,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90632600] [2024-10-14 06:21:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:46,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:46,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90632600] [2024-10-14 06:21:46,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90632600] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:21:46,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023024471] [2024-10-14 06:21:46,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:46,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:21:46,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:21:46,416 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-10-14 06:21:46,418 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-10-14 06:21:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:46,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-14 06:21:46,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:21:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:47,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:21:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:48,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023024471] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:21:48,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 06:21:48,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 14] total 32 [2024-10-14 06:21:48,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513231555] [2024-10-14 06:21:48,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 06:21:48,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-14 06:21:48,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:48,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-14 06:21:48,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2024-10-14 06:21:48,078 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 32 states, 32 states have (on average 4.875) internal successors, (156), 32 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:49,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:49,561 INFO L93 Difference]: Finished difference Result 215 states and 268 transitions. [2024-10-14 06:21:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-14 06:21:49,561 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.875) internal successors, (156), 32 states have internal predecessors, (156), 0 states have call successors, (0), 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 57 [2024-10-14 06:21:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:49,562 INFO L225 Difference]: With dead ends: 215 [2024-10-14 06:21:49,563 INFO L226 Difference]: Without dead ends: 163 [2024-10-14 06:21:49,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=539, Invalid=3367, Unknown=0, NotChecked=0, Total=3906 [2024-10-14 06:21:49,565 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 302 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:49,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 702 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 06:21:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-14 06:21:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 81. [2024-10-14 06:21:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:49,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2024-10-14 06:21:49,572 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 57 [2024-10-14 06:21:49,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:49,573 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2024-10-14 06:21:49,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.875) internal successors, (156), 32 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2024-10-14 06:21:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 06:21:49,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:49,574 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] [2024-10-14 06:21:49,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 06:21:49,774 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,SelfDestructingSolverStorable11 [2024-10-14 06:21:49,775 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:49,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1564006215, now seen corresponding path program 1 times [2024-10-14 06:21:49,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:49,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540876671] [2024-10-14 06:21:49,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:49,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 06:21:50,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:50,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540876671] [2024-10-14 06:21:50,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540876671] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:21:50,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406444537] [2024-10-14 06:21:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:50,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:21:50,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:21:50,491 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-10-14 06:21:50,493 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-10-14 06:21:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:50,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-14 06:21:50,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:21:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 06:21:51,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:21:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 06:21:51,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406444537] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:21:51,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 06:21:51,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 11] total 21 [2024-10-14 06:21:51,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110614820] [2024-10-14 06:21:51,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 06:21:51,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 06:21:51,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:51,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 06:21:51,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-10-14 06:21:51,914 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 22 states, 22 states have (on average 6.545454545454546) internal successors, (144), 21 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:52,489 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2024-10-14 06:21:52,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 06:21:52,491 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.545454545454546) internal successors, (144), 21 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-14 06:21:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:52,492 INFO L225 Difference]: With dead ends: 180 [2024-10-14 06:21:52,492 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 06:21:52,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 06:21:52,493 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 112 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:52,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 405 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 06:21:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 06:21:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 84. [2024-10-14 06:21:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.216867469879518) internal successors, (101), 83 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2024-10-14 06:21:52,499 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 58 [2024-10-14 06:21:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:52,500 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2024-10-14 06:21:52,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.545454545454546) internal successors, (144), 21 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2024-10-14 06:21:52,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 06:21:52,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:52,501 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-10-14 06:21:52,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 06:21:52,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:21:52,702 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:52,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:52,704 INFO L85 PathProgramCache]: Analyzing trace with hash 499559409, now seen corresponding path program 1 times [2024-10-14 06:21:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:52,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717289841] [2024-10-14 06:21:52,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:52,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:54,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:54,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717289841] [2024-10-14 06:21:54,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717289841] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:21:54,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810642154] [2024-10-14 06:21:54,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:54,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:21:54,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:21:54,298 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:21:54,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 06:21:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:54,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-14 06:21:54,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:21:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:54,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:21:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 35 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:21:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810642154] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:21:55,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 06:21:55,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2024-10-14 06:21:55,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160359461] [2024-10-14 06:21:55,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 06:21:55,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-14 06:21:55,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:55,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-14 06:21:55,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 06:21:55,605 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 35 states, 35 states have (on average 4.628571428571429) internal successors, (162), 35 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:57,266 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2024-10-14 06:21:57,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-14 06:21:57,267 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.628571428571429) internal successors, (162), 35 states have internal predecessors, (162), 0 states have call successors, (0), 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-10-14 06:21:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:57,268 INFO L225 Difference]: With dead ends: 177 [2024-10-14 06:21:57,268 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 06:21:57,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=730, Invalid=4240, Unknown=0, NotChecked=0, Total=4970 [2024-10-14 06:21:57,270 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 262 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:57,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 543 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 06:21:57,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 06:21:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 70. [2024-10-14 06:21:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 69 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2024-10-14 06:21:57,275 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 59 [2024-10-14 06:21:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:57,275 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2024-10-14 06:21:57,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.628571428571429) internal successors, (162), 35 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2024-10-14 06:21:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 06:21:57,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:57,277 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] [2024-10-14 06:21:57,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 06:21:57,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:21:57,482 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:57,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:57,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1558898799, now seen corresponding path program 1 times [2024-10-14 06:21:57,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:57,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27146306] [2024-10-14 06:21:57,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:57,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:21:57,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 06:21:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:21:57,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 06:21:57,799 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 06:21:57,801 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 06:21:57,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 06:21:57,805 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:21:57,868 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 06:21:57,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:21:57 BoogieIcfgContainer [2024-10-14 06:21:57,875 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 06:21:57,875 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 06:21:57,875 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 06:21:57,876 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 06:21:57,876 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:21:33" (3/4) ... [2024-10-14 06:21:57,878 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 06:21:57,879 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 06:21:57,880 INFO L158 Benchmark]: Toolchain (without parser) took 25988.94ms. Allocated memory was 186.6MB in the beginning and 469.8MB in the end (delta: 283.1MB). Free memory was 156.9MB in the beginning and 331.9MB in the end (delta: -175.0MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. [2024-10-14 06:21:57,880 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:21:57,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.41ms. Allocated memory is still 186.6MB. Free memory was 156.7MB in the beginning and 146.5MB in the end (delta: 10.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-14 06:21:57,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.95ms. Allocated memory is still 186.6MB. Free memory was 146.5MB in the beginning and 142.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 06:21:57,881 INFO L158 Benchmark]: Boogie Preprocessor took 82.58ms. Allocated memory is still 186.6MB. Free memory was 142.3MB in the beginning and 138.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 06:21:57,881 INFO L158 Benchmark]: RCFGBuilder took 612.30ms. Allocated memory is still 186.6MB. Free memory was 138.9MB in the beginning and 110.9MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-14 06:21:57,882 INFO L158 Benchmark]: TraceAbstraction took 24851.76ms. Allocated memory was 186.6MB in the beginning and 469.8MB in the end (delta: 283.1MB). Free memory was 110.3MB in the beginning and 332.9MB in the end (delta: -222.6MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2024-10-14 06:21:57,882 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 469.8MB. Free memory is still 331.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:21:57,883 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 130.0MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.41ms. Allocated memory is still 186.6MB. Free memory was 156.7MB in the beginning and 146.5MB in the end (delta: 10.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.95ms. Allocated memory is still 186.6MB. Free memory was 146.5MB in the beginning and 142.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.58ms. Allocated memory is still 186.6MB. Free memory was 142.3MB in the beginning and 138.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 612.30ms. Allocated memory is still 186.6MB. Free memory was 138.9MB in the beginning and 110.9MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24851.76ms. Allocated memory was 186.6MB in the beginning and 469.8MB in the end (delta: 283.1MB). Free memory was 110.3MB in the beginning and 332.9MB in the end (delta: -222.6MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 469.8MB. Free memory is still 331.9MB. 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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.7s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1180 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1180 mSDsluCounter, 3769 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3153 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3785 IncrementalHoareTripleChecker+Invalid, 3831 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 616 mSDtfsCounter, 3785 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 851 GetRequests, 575 SyntacticMatches, 3 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2562 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=11, InterpolantAutomatonStates: 166, 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, 270 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 898 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1112 ConstructedInterpolants, 0 QuantifiedInterpolants, 12180 SizeOfPredicates, 24 NumberOfNonLiveVariables, 2334 ConjunctsInSsa, 351 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 369/521 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 06:21:57,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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-wip.fs.cvc5-61a6796-m [2024-10-14 06:22:00,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:22:00,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 06:22:00,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:22:00,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:22:00,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:22:00,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:22:00,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:22:00,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:22:00,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:22:00,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:22:00,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:22:00,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:22:00,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:22:00,270 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:22:00,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:22:00,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:22:00,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:22:00,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:22:00,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:22:00,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:22:00,276 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 06:22:00,276 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 06:22:00,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:22:00,276 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 06:22:00,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:22:00,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:22:00,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:22:00,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:22:00,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:22:00,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:22:00,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:22:00,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:22:00,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:22:00,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:22:00,282 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 06:22:00,282 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 06:22:00,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:22:00,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:22:00,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:22:00,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:22:00,284 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 06:22:00,284 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-10-14 06:22:00,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:22:00,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:22:00,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:22:00,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:22:00,665 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:22:00,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2024-10-14 06:22:02,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:22:02,608 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:22:02,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2024-10-14 06:22:02,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2130c6774/4359de87859545f19a78ffaee3070bc8/FLAG26b67bb22 [2024-10-14 06:22:02,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2130c6774/4359de87859545f19a78ffaee3070bc8 [2024-10-14 06:22:02,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:22:02,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:22:02,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:22:02,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:22:02,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:22:02,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:22:02" (1/1) ... [2024-10-14 06:22:02,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be755f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:02, skipping insertion in model container [2024-10-14 06:22:02,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:22:02" (1/1) ... [2024-10-14 06:22:02,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:22:02,888 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c[1245,1258] [2024-10-14 06:22:02,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:22:02,965 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:22:02,981 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c[1245,1258] [2024-10-14 06:22:03,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:22:03,036 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:22:03,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03 WrapperNode [2024-10-14 06:22:03,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:22:03,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:22:03,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:22:03,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:22:03,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (1/1) ... [2024-10-14 06:22:03,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (1/1) ... [2024-10-14 06:22:03,086 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-10-14 06:22:03,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:22:03,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:22:03,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:22:03,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:22:03,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (1/1) ... [2024-10-14 06:22:03,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (1/1) ... [2024-10-14 06:22:03,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (1/1) ... [2024-10-14 06:22:03,119 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-14 06:22:03,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (1/1) ... [2024-10-14 06:22:03,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (1/1) ... [2024-10-14 06:22:03,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (1/1) ... [2024-10-14 06:22:03,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (1/1) ... [2024-10-14 06:22:03,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (1/1) ... [2024-10-14 06:22:03,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (1/1) ... [2024-10-14 06:22:03,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:22:03,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:22:03,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:22:03,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:22:03,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (1/1) ... [2024-10-14 06:22:03,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:22:03,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:22:03,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 06:22:03,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 06:22:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:22:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 06:22:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 06:22:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:22:03,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:22:03,335 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:22:03,338 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:22:03,569 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-10-14 06:22:03,569 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:22:03,606 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:22:03,606 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:22:03,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:22:03 BoogieIcfgContainer [2024-10-14 06:22:03,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:22:03,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:22:03,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:22:03,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:22:03,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:22:02" (1/3) ... [2024-10-14 06:22:03,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b568a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:22:03, skipping insertion in model container [2024-10-14 06:22:03,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:03" (2/3) ... [2024-10-14 06:22:03,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b568a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:22:03, skipping insertion in model container [2024-10-14 06:22:03,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:22:03" (3/3) ... [2024-10-14 06:22:03,620 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b04.c [2024-10-14 06:22:03,638 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:22:03,639 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:22:03,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:22:03,701 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;@51e37f2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:22:03,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:22:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 06:22:03,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:03,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 06:22:03,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:03,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:03,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 06:22:03,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:22:03,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993795587] [2024-10-14 06:22:03,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:03,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:22:03,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:22:03,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:22:03,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 06:22:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:03,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 06:22:03,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:22:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:22:04,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:22:04,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:22:04,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993795587] [2024-10-14 06:22:04,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993795587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:04,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:04,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 06:22:04,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106354129] [2024-10-14 06:22:04,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:04,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:22:04,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:22:04,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:22:04,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:22:04,223 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:04,282 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 06:22:04,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:22:04,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 06:22:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:04,292 INFO L225 Difference]: With dead ends: 15 [2024-10-14 06:22:04,292 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 06:22:04,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:22:04,300 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:04,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:22:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 06:22:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 06:22:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 06:22:04,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 06:22:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:04,331 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 06:22:04,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 06:22:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 06:22:04,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:04,332 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 06:22:04,337 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-10-14 06:22:04,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:22:04,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:04,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:04,535 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 06:22:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:22:04,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139920425] [2024-10-14 06:22:04,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:04,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:22:04,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:22:04,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:22:04,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 06:22:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:04,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 06:22:04,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:22:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:22:04,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:22:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:22:05,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:22:05,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139920425] [2024-10-14 06:22:05,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139920425] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:22:05,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 06:22:05,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 06:22:05,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471239244] [2024-10-14 06:22:05,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 06:22:05,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:22:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:22:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:22:05,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:22:05,205 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:05,288 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-14 06:22:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:22:05,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 06:22:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:05,290 INFO L225 Difference]: With dead ends: 14 [2024-10-14 06:22:05,290 INFO L226 Difference]: Without dead ends: 12 [2024-10-14 06:22:05,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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-10-14 06:22:05,292 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:05,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:22:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-14 06:22:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-14 06:22:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 06:22:05,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 06:22:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:05,298 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 06:22:05,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 06:22:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 06:22:05,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:05,299 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-14 06:22:05,305 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-10-14 06:22:05,499 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-10-14 06:22:05,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:05,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-14 06:22:05,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:22:05,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78524383] [2024-10-14 06:22:05,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 06:22:05,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:22:05,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:22:05,505 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-10-14 06:22:05,506 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-10-14 06:22:05,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 06:22:05,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 06:22:05,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 06:22:05,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:22:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:22:05,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:22:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:22:06,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:22:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78524383] [2024-10-14 06:22:06,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78524383] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:22:06,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 06:22:06,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-14 06:22:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741995240] [2024-10-14 06:22:06,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 06:22:06,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 06:22:06,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:22:06,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 06:22:06,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:22:06,325 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:06,498 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2024-10-14 06:22:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 06:22:06,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 06:22:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:06,499 INFO L225 Difference]: With dead ends: 12 [2024-10-14 06:22:06,499 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 06:22:06,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 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-10-14 06:22:06,501 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:06,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:22:06,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 06:22:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 06:22:06,502 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-10-14 06:22:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 06:22:06,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2024-10-14 06:22:06,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:06,503 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 06:22:06,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 06:22:06,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 06:22:06,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 06:22:06,511 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 (4)] Ended with exit code 0 [2024-10-14 06:22:06,710 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-10-14 06:22:06,714 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-10-14 06:22:06,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 06:22:06,760 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 06:22:06,775 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 06:22:06,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:22:06 BoogieIcfgContainer [2024-10-14 06:22:06,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 06:22:06,781 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 06:22:06,781 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 06:22:06,781 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 06:22:06,782 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:22:03" (3/4) ... [2024-10-14 06:22:06,784 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 06:22:06,798 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-14 06:22:06,799 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 06:22:06,799 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 06:22:06,801 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 06:22:06,801 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 06:22:06,901 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 06:22:06,902 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 06:22:06,902 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 06:22:06,902 INFO L158 Benchmark]: Toolchain (without parser) took 4246.77ms. Allocated memory was 65.0MB in the beginning and 130.0MB in the end (delta: 65.0MB). Free memory was 44.9MB in the beginning and 83.6MB in the end (delta: -38.7MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-10-14 06:22:06,903 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 41.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:22:06,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.48ms. Allocated memory is still 65.0MB. Free memory was 44.7MB in the beginning and 30.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 06:22:06,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.81ms. Allocated memory is still 65.0MB. Free memory was 30.9MB in the beginning and 28.8MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 06:22:06,904 INFO L158 Benchmark]: Boogie Preprocessor took 62.51ms. Allocated memory is still 65.0MB. Free memory was 28.8MB in the beginning and 26.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 06:22:06,904 INFO L158 Benchmark]: RCFGBuilder took 455.78ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 26.5MB in the beginning and 51.2MB in the end (delta: -24.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 06:22:06,904 INFO L158 Benchmark]: TraceAbstraction took 3169.73ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 50.5MB in the beginning and 89.9MB in the end (delta: -39.4MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2024-10-14 06:22:06,905 INFO L158 Benchmark]: Witness Printer took 120.95ms. Allocated memory is still 130.0MB. Free memory was 89.9MB in the beginning and 83.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 06:22:06,906 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.14ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 41.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.48ms. Allocated memory is still 65.0MB. Free memory was 44.7MB in the beginning and 30.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.81ms. Allocated memory is still 65.0MB. Free memory was 30.9MB in the beginning and 28.8MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.51ms. Allocated memory is still 65.0MB. Free memory was 28.8MB in the beginning and 26.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 455.78ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 26.5MB in the beginning and 51.2MB in the end (delta: -24.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3169.73ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 50.5MB in the beginning and 89.9MB in the end (delta: -39.4MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * Witness Printer took 120.95ms. Allocated memory is still 130.0MB. Free memory was 89.9MB in the beginning and 83.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, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 4 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred 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.6s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 12 QuantifiedInterpolants, 840 SizeOfPredicates, 17 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 82 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-10-14 06:22:06,942 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