./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:29:52,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:29:53,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:29:53,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:29:53,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:29:53,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:29:53,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:29:53,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:29:53,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:29:53,091 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:29:53,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:29:53,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:29:53,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:29:53,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:29:53,095 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:29:53,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:29:53,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:29:53,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:29:53,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:29:53,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:29:53,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:29:53,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:29:53,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:29:53,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:29:53,101 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:29:53,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:29:53,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:29:53,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:29:53,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:29:53,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:29:53,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:29:53,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:29:53,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:29:53,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:29:53,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:29:53,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:29:53,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:29:53,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:29:53,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:29:53,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:29:53,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:29:53,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:29:53,107 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-10-10 22:29:53,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:29:53,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:29:53,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:29:53,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:29:53,407 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:29:53,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-10-10 22:29:54,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:29:55,024 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:29:55,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-10-10 22:29:55,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c99ad8e98/525d686d0aee4a2d832af03f9e5e98e8/FLAG65ae9f22a [2024-10-10 22:29:55,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c99ad8e98/525d686d0aee4a2d832af03f9e5e98e8 [2024-10-10 22:29:55,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:29:55,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:29:55,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:29:55,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:29:55,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:29:55,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779d6700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55, skipping insertion in model container [2024-10-10 22:29:55,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:29:55,257 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/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-10-10 22:29:55,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:29:55,332 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:29:55,345 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/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-10-10 22:29:55,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:29:55,405 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:29:55,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55 WrapperNode [2024-10-10 22:29:55,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:29:55,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:29:55,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:29:55,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:29:55,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,446 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-10-10 22:29:55,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:29:55,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:29:55,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:29:55,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:29:55,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,486 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:29:55,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:29:55,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:29:55,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:29:55,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:29:55,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (1/1) ... [2024-10-10 22:29:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:29:55,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:55,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:29:55,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:29:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:29:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:29:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-10 22:29:55,603 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-10 22:29:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:29:55,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:29:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-10-10 22:29:55,605 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-10-10 22:29:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-10 22:29:55,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-10 22:29:55,666 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:29:55,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:29:55,980 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-10 22:29:55,981 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:29:56,016 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:29:56,016 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 22:29:56,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:56 BoogieIcfgContainer [2024-10-10 22:29:56,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:29:56,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:29:56,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:29:56,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:29:56,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:29:55" (1/3) ... [2024-10-10 22:29:56,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f644c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:29:56, skipping insertion in model container [2024-10-10 22:29:56,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:55" (2/3) ... [2024-10-10 22:29:56,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f644c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:29:56, skipping insertion in model container [2024-10-10 22:29:56,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:56" (3/3) ... [2024-10-10 22:29:56,026 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-10-10 22:29:56,047 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:29:56,048 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:29:56,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:29:56,112 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;@5e9c8df6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:29:56,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:29:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 60 states have internal predecessors, (91), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-10 22:29:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 22:29:56,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:56,126 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:56,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:56,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash -668292288, now seen corresponding path program 1 times [2024-10-10 22:29:56,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:56,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250807306] [2024-10-10 22:29:56,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:56,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250807306] [2024-10-10 22:29:56,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250807306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:56,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867350904] [2024-10-10 22:29:56,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:56,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:56,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:56,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:56,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:29:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-10 22:29:57,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:57,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867350904] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:57,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:57,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-10 22:29:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043429624] [2024-10-10 22:29:57,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:57,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-10 22:29:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:57,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-10 22:29:57,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:29:57,289 INFO L87 Difference]: Start difference. First operand has 73 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 60 states have internal predecessors, (91), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:29:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:57,514 INFO L93 Difference]: Finished difference Result 164 states and 259 transitions. [2024-10-10 22:29:57,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:29:57,516 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2024-10-10 22:29:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:57,527 INFO L225 Difference]: With dead ends: 164 [2024-10-10 22:29:57,528 INFO L226 Difference]: Without dead ends: 90 [2024-10-10 22:29:57,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:29:57,534 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 28 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:57,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 998 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-10 22:29:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2024-10-10 22:29:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.4) internal successors, (91), 67 states have internal predecessors, (91), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-10 22:29:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2024-10-10 22:29:57,576 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 31 [2024-10-10 22:29:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:57,580 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2024-10-10 22:29:57,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:29:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2024-10-10 22:29:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:29:57,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:57,583 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-10 22:29:57,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:29:57,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-10 22:29:57,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:57,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:57,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1170817681, now seen corresponding path program 1 times [2024-10-10 22:29:57,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:57,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93331890] [2024-10-10 22:29:57,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:57,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:29:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:58,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:58,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93331890] [2024-10-10 22:29:58,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93331890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:58,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:58,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-10 22:29:58,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660621681] [2024-10-10 22:29:58,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:58,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 22:29:58,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:58,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 22:29:58,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:29:58,023 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand has 8 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:58,113 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2024-10-10 22:29:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:29:58,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-10 22:29:58,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:58,117 INFO L225 Difference]: With dead ends: 150 [2024-10-10 22:29:58,117 INFO L226 Difference]: Without dead ends: 103 [2024-10-10 22:29:58,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:29:58,120 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 12 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:58,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 637 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-10 22:29:58,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2024-10-10 22:29:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 72 states have internal predecessors, (96), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-10 22:29:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2024-10-10 22:29:58,145 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 35 [2024-10-10 22:29:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:58,146 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2024-10-10 22:29:58,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2024-10-10 22:29:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:29:58,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:58,148 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-10 22:29:58,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:29:58,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:58,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1441771179, now seen corresponding path program 1 times [2024-10-10 22:29:58,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:58,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843405601] [2024-10-10 22:29:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:58,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:29:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-10 22:29:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:29:58,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:58,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843405601] [2024-10-10 22:29:58,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843405601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:58,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:58,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-10 22:29:58,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30945254] [2024-10-10 22:29:58,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:58,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:29:58,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:58,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:29:58,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:29:58,451 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 10 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:29:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:58,577 INFO L93 Difference]: Finished difference Result 148 states and 207 transitions. [2024-10-10 22:29:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:29:58,578 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-10-10 22:29:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:58,579 INFO L225 Difference]: With dead ends: 148 [2024-10-10 22:29:58,580 INFO L226 Difference]: Without dead ends: 137 [2024-10-10 22:29:58,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:29:58,581 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 60 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:58,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 814 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-10 22:29:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2024-10-10 22:29:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 100 states have internal predecessors, (134), 17 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2024-10-10 22:29:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 173 transitions. [2024-10-10 22:29:58,606 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 173 transitions. Word has length 38 [2024-10-10 22:29:58,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:58,606 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 173 transitions. [2024-10-10 22:29:58,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:29:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 173 transitions. [2024-10-10 22:29:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:29:58,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:58,608 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-10 22:29:58,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:29:58,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:58,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1077529527, now seen corresponding path program 1 times [2024-10-10 22:29:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:58,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684234301] [2024-10-10 22:29:58,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:58,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:29:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:58,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:58,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684234301] [2024-10-10 22:29:58,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684234301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:58,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:58,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-10 22:29:58,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295277329] [2024-10-10 22:29:58,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:58,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:29:58,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:58,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:29:58,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:29:58,824 INFO L87 Difference]: Start difference. First operand 122 states and 173 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:29:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:58,950 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2024-10-10 22:29:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:29:58,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-10-10 22:29:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:58,953 INFO L225 Difference]: With dead ends: 204 [2024-10-10 22:29:58,954 INFO L226 Difference]: Without dead ends: 165 [2024-10-10 22:29:58,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:29:58,956 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 81 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:58,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 725 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:58,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-10 22:29:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 129. [2024-10-10 22:29:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 105 states have internal predecessors, (140), 18 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (22), 17 states have call predecessors, (22), 17 states have call successors, (22) [2024-10-10 22:29:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 180 transitions. [2024-10-10 22:29:58,985 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 180 transitions. Word has length 38 [2024-10-10 22:29:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:58,986 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 180 transitions. [2024-10-10 22:29:58,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:29:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 180 transitions. [2024-10-10 22:29:58,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:29:58,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:58,990 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-10 22:29:58,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:29:58,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:58,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1048744169, now seen corresponding path program 1 times [2024-10-10 22:29:58,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:58,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616430728] [2024-10-10 22:29:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:58,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:29:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-10 22:29:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:29:59,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:59,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616430728] [2024-10-10 22:29:59,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616430728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:59,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:59,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-10 22:29:59,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117111559] [2024-10-10 22:29:59,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:59,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-10 22:29:59,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:59,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-10 22:29:59,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-10 22:29:59,335 INFO L87 Difference]: Start difference. First operand 129 states and 180 transitions. Second operand has 15 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-10 22:29:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:59,573 INFO L93 Difference]: Finished difference Result 188 states and 264 transitions. [2024-10-10 22:29:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-10 22:29:59,574 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2024-10-10 22:29:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:59,576 INFO L225 Difference]: With dead ends: 188 [2024-10-10 22:29:59,576 INFO L226 Difference]: Without dead ends: 180 [2024-10-10 22:29:59,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:29:59,577 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 56 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:59,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1150 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:29:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-10 22:29:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 136. [2024-10-10 22:29:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 108 states have (on average 1.3611111111111112) internal successors, (147), 110 states have internal predecessors, (147), 18 states have call successors, (18), 6 states have call predecessors, (18), 9 states have return successors, (24), 19 states have call predecessors, (24), 17 states have call successors, (24) [2024-10-10 22:29:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2024-10-10 22:29:59,591 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 38 [2024-10-10 22:29:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:59,591 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2024-10-10 22:29:59,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-10 22:29:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-10-10 22:29:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:29:59,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:59,593 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-10 22:29:59,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:29:59,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:59,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1470556537, now seen corresponding path program 1 times [2024-10-10 22:29:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:59,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479440418] [2024-10-10 22:29:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:29:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:59,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479440418] [2024-10-10 22:29:59,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479440418] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:59,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989020075] [2024-10-10 22:29:59,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:59,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:59,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:59,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:59,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:29:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-10 22:29:59,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:59,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:59,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989020075] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:59,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:59,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-10 22:29:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585189842] [2024-10-10 22:29:59,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:59,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 22:29:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 22:29:59,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:29:59,968 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:30:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:00,058 INFO L93 Difference]: Finished difference Result 229 states and 313 transitions. [2024-10-10 22:30:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:30:00,058 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 38 [2024-10-10 22:30:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:00,060 INFO L225 Difference]: With dead ends: 229 [2024-10-10 22:30:00,060 INFO L226 Difference]: Without dead ends: 151 [2024-10-10 22:30:00,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-10 22:30:00,061 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 16 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:00,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 928 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-10 22:30:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 142. [2024-10-10 22:30:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 113 states have (on average 1.336283185840708) internal successors, (151), 114 states have internal predecessors, (151), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (22), 19 states have call predecessors, (22), 18 states have call successors, (22) [2024-10-10 22:30:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 192 transitions. [2024-10-10 22:30:00,073 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 192 transitions. Word has length 38 [2024-10-10 22:30:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:00,073 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 192 transitions. [2024-10-10 22:30:00,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:30:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 192 transitions. [2024-10-10 22:30:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:30:00,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:00,075 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-10 22:30:00,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:30:00,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:00,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:00,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:00,276 INFO L85 PathProgramCache]: Analyzing trace with hash 923501869, now seen corresponding path program 1 times [2024-10-10 22:30:00,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:00,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544882994] [2024-10-10 22:30:00,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:00,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:30:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:30:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-10 22:30:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:30:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:00,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544882994] [2024-10-10 22:30:00,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544882994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:00,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:00,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:30:00,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877041456] [2024-10-10 22:30:00,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:00,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:00,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:00,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:00,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:00,373 INFO L87 Difference]: Start difference. First operand 142 states and 192 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-10 22:30:00,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:00,410 INFO L93 Difference]: Finished difference Result 150 states and 199 transitions. [2024-10-10 22:30:00,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:00,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2024-10-10 22:30:00,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:00,412 INFO L225 Difference]: With dead ends: 150 [2024-10-10 22:30:00,412 INFO L226 Difference]: Without dead ends: 130 [2024-10-10 22:30:00,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:30:00,413 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:00,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 463 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-10 22:30:00,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-10 22:30:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 106 states have internal predecessors, (141), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-10 22:30:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2024-10-10 22:30:00,428 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 40 [2024-10-10 22:30:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:00,428 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2024-10-10 22:30:00,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-10 22:30:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2024-10-10 22:30:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 22:30:00,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:00,429 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-10 22:30:00,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:30:00,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:00,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:00,430 INFO L85 PathProgramCache]: Analyzing trace with hash -218290978, now seen corresponding path program 2 times [2024-10-10 22:30:00,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:00,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211776698] [2024-10-10 22:30:00,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:00,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:00,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211776698] [2024-10-10 22:30:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211776698] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773475711] [2024-10-10 22:30:00,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:30:00,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:00,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:00,561 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:00,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:30:00,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-10 22:30:00,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:00,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-10 22:30:00,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:00,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:00,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773475711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:00,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:00,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2024-10-10 22:30:00,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396156445] [2024-10-10 22:30:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:00,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:30:00,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:00,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:30:00,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:30:00,772 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:01,036 INFO L93 Difference]: Finished difference Result 264 states and 363 transitions. [2024-10-10 22:30:01,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:30:01,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-10-10 22:30:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:01,039 INFO L225 Difference]: With dead ends: 264 [2024-10-10 22:30:01,039 INFO L226 Difference]: Without dead ends: 210 [2024-10-10 22:30:01,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:30:01,041 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 92 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:01,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1304 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:30:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-10 22:30:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 174. [2024-10-10 22:30:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 140 states have (on average 1.35) internal successors, (189), 143 states have internal predecessors, (189), 22 states have call successors, (22), 9 states have call predecessors, (22), 11 states have return successors, (28), 21 states have call predecessors, (28), 21 states have call successors, (28) [2024-10-10 22:30:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 239 transitions. [2024-10-10 22:30:01,056 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 239 transitions. Word has length 39 [2024-10-10 22:30:01,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:01,057 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 239 transitions. [2024-10-10 22:30:01,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 239 transitions. [2024-10-10 22:30:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 22:30:01,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:01,059 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-10 22:30:01,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:30:01,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:01,263 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:01,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -611317988, now seen corresponding path program 1 times [2024-10-10 22:30:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:01,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712391215] [2024-10-10 22:30:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:01,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:01,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:01,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712391215] [2024-10-10 22:30:01,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712391215] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:01,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708240923] [2024-10-10 22:30:01,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:01,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:01,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:01,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:01,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:30:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-10 22:30:01,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:01,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:01,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708240923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:01,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:01,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 17 [2024-10-10 22:30:01,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566491295] [2024-10-10 22:30:01,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:01,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 22:30:01,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:01,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 22:30:01,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:30:01,684 INFO L87 Difference]: Start difference. First operand 174 states and 239 transitions. Second operand has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:01,927 INFO L93 Difference]: Finished difference Result 337 states and 469 transitions. [2024-10-10 22:30:01,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-10 22:30:01,927 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-10-10 22:30:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:01,929 INFO L225 Difference]: With dead ends: 337 [2024-10-10 22:30:01,929 INFO L226 Difference]: Without dead ends: 264 [2024-10-10 22:30:01,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-10-10 22:30:01,930 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 64 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:01,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1622 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:30:01,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-10 22:30:01,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 246. [2024-10-10 22:30:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 200 states have (on average 1.345) internal successors, (269), 203 states have internal predecessors, (269), 31 states have call successors, (31), 12 states have call predecessors, (31), 14 states have return successors, (39), 30 states have call predecessors, (39), 30 states have call successors, (39) [2024-10-10 22:30:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 339 transitions. [2024-10-10 22:30:01,944 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 339 transitions. Word has length 39 [2024-10-10 22:30:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:01,944 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 339 transitions. [2024-10-10 22:30:01,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:01,945 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 339 transitions. [2024-10-10 22:30:01,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:30:01,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:01,946 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:01,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:02,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-10 22:30:02,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:02,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash 395961112, now seen corresponding path program 1 times [2024-10-10 22:30:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:02,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839489696] [2024-10-10 22:30:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:02,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:02,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:02,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:30:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:02,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-10 22:30:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:02,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-10 22:30:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:02,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839489696] [2024-10-10 22:30:02,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839489696] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:02,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605665364] [2024-10-10 22:30:02,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:02,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:02,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:02,371 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:02,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:30:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:02,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-10 22:30:02,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:02,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:03,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605665364] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:03,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:03,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-10-10 22:30:03,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38249779] [2024-10-10 22:30:03,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:03,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-10 22:30:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:03,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-10 22:30:03,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-10-10 22:30:03,023 INFO L87 Difference]: Start difference. First operand 246 states and 339 transitions. Second operand has 32 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 25 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-10 22:30:04,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:04,677 INFO L93 Difference]: Finished difference Result 455 states and 656 transitions. [2024-10-10 22:30:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-10 22:30:04,678 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 25 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2024-10-10 22:30:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:04,680 INFO L225 Difference]: With dead ends: 455 [2024-10-10 22:30:04,681 INFO L226 Difference]: Without dead ends: 431 [2024-10-10 22:30:04,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2024-10-10 22:30:04,683 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 269 mSDsluCounter, 4073 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 4269 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:04,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 4269 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:30:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-10 22:30:04,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 291. [2024-10-10 22:30:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 233 states have (on average 1.3304721030042919) internal successors, (310), 241 states have internal predecessors, (310), 38 states have call successors, (38), 11 states have call predecessors, (38), 19 states have return successors, (58), 38 states have call predecessors, (58), 37 states have call successors, (58) [2024-10-10 22:30:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 406 transitions. [2024-10-10 22:30:04,714 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 406 transitions. Word has length 42 [2024-10-10 22:30:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:04,714 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 406 transitions. [2024-10-10 22:30:04,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 25 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-10 22:30:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 406 transitions. [2024-10-10 22:30:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:30:04,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:04,717 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:04,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 22:30:04,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 22:30:04,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:04,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:04,918 INFO L85 PathProgramCache]: Analyzing trace with hash 904042908, now seen corresponding path program 2 times [2024-10-10 22:30:04,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:04,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934197765] [2024-10-10 22:30:04,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:04,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:05,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:05,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:05,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:05,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-10 22:30:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:05,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-10 22:30:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:05,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934197765] [2024-10-10 22:30:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934197765] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106718553] [2024-10-10 22:30:05,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:30:05,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:05,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:05,146 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:05,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:30:05,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:30:05,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:05,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-10 22:30:05,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:05,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:05,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106718553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:05,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:05,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-10-10 22:30:05,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445866620] [2024-10-10 22:30:05,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:05,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-10 22:30:05,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:05,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-10 22:30:05,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-10-10 22:30:05,778 INFO L87 Difference]: Start difference. First operand 291 states and 406 transitions. Second operand has 32 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-10 22:30:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:07,038 INFO L93 Difference]: Finished difference Result 497 states and 736 transitions. [2024-10-10 22:30:07,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-10 22:30:07,039 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 42 [2024-10-10 22:30:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:07,042 INFO L225 Difference]: With dead ends: 497 [2024-10-10 22:30:07,042 INFO L226 Difference]: Without dead ends: 484 [2024-10-10 22:30:07,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=295, Invalid=3245, Unknown=0, NotChecked=0, Total=3540 [2024-10-10 22:30:07,045 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 382 mSDsluCounter, 2722 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 2884 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:07,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 2884 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:30:07,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-10 22:30:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 305. [2024-10-10 22:30:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 241 states have (on average 1.3195020746887967) internal successors, (318), 250 states have internal predecessors, (318), 42 states have call successors, (42), 12 states have call predecessors, (42), 21 states have return successors, (74), 42 states have call predecessors, (74), 41 states have call successors, (74) [2024-10-10 22:30:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 434 transitions. [2024-10-10 22:30:07,076 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 434 transitions. Word has length 42 [2024-10-10 22:30:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:07,076 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 434 transitions. [2024-10-10 22:30:07,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-10 22:30:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 434 transitions. [2024-10-10 22:30:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:30:07,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:07,078 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:07,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 22:30:07,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 22:30:07,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:07,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2008284808, now seen corresponding path program 1 times [2024-10-10 22:30:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:07,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315383970] [2024-10-10 22:30:07,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:07,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-10 22:30:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:07,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315383970] [2024-10-10 22:30:07,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315383970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:07,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:07,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-10 22:30:07,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353590999] [2024-10-10 22:30:07,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:07,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:30:07,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:07,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:30:07,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:07,447 INFO L87 Difference]: Start difference. First operand 305 states and 434 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:07,536 INFO L93 Difference]: Finished difference Result 325 states and 455 transitions. [2024-10-10 22:30:07,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:30:07,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-10 22:30:07,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:07,539 INFO L225 Difference]: With dead ends: 325 [2024-10-10 22:30:07,539 INFO L226 Difference]: Without dead ends: 282 [2024-10-10 22:30:07,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:30:07,540 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:07,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 732 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-10 22:30:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 277. [2024-10-10 22:30:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 217 states have (on average 1.304147465437788) internal successors, (283), 225 states have internal predecessors, (283), 39 states have call successors, (39), 12 states have call predecessors, (39), 20 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2024-10-10 22:30:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 391 transitions. [2024-10-10 22:30:07,563 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 391 transitions. Word has length 42 [2024-10-10 22:30:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:07,564 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 391 transitions. [2024-10-10 22:30:07,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 391 transitions. [2024-10-10 22:30:07,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:30:07,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:07,565 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:07,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:30:07,566 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:07,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:07,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1929671845, now seen corresponding path program 1 times [2024-10-10 22:30:07,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:07,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425608558] [2024-10-10 22:30:07,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:07,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-10 22:30:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:07,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425608558] [2024-10-10 22:30:07,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425608558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71187345] [2024-10-10 22:30:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:07,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:07,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:07,612 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:07,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:30:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:30:07,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:30:07,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:07,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71187345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:07,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:07,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-10 22:30:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952202018] [2024-10-10 22:30:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:07,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:07,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:07,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:07,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:30:07,685 INFO L87 Difference]: Start difference. First operand 277 states and 391 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:07,732 INFO L93 Difference]: Finished difference Result 557 states and 790 transitions. [2024-10-10 22:30:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:07,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-10-10 22:30:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:07,734 INFO L225 Difference]: With dead ends: 557 [2024-10-10 22:30:07,734 INFO L226 Difference]: Without dead ends: 282 [2024-10-10 22:30:07,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:30:07,737 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:07,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 169 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-10 22:30:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2024-10-10 22:30:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 220 states have (on average 1.3045454545454545) internal successors, (287), 228 states have internal predecessors, (287), 39 states have call successors, (39), 12 states have call predecessors, (39), 20 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2024-10-10 22:30:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 395 transitions. [2024-10-10 22:30:07,755 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 395 transitions. Word has length 42 [2024-10-10 22:30:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:07,755 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 395 transitions. [2024-10-10 22:30:07,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 395 transitions. [2024-10-10 22:30:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 22:30:07,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:07,757 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:07,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:07,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:07,962 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:07,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -286745755, now seen corresponding path program 1 times [2024-10-10 22:30:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:07,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863803704] [2024-10-10 22:30:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-10 22:30:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:30:08,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863803704] [2024-10-10 22:30:08,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863803704] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109575921] [2024-10-10 22:30:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:08,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:08,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:08,032 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:08,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 22:30:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:30:08,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:30:08,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109575921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-10-10 22:30:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197105963] [2024-10-10 22:30:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:08,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:08,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:08,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:08,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:08,106 INFO L87 Difference]: Start difference. First operand 280 states and 395 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:08,152 INFO L93 Difference]: Finished difference Result 563 states and 799 transitions. [2024-10-10 22:30:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:08,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-10-10 22:30:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:08,155 INFO L225 Difference]: With dead ends: 563 [2024-10-10 22:30:08,155 INFO L226 Difference]: Without dead ends: 285 [2024-10-10 22:30:08,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:08,157 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:08,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-10 22:30:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2024-10-10 22:30:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 222 states have (on average 1.3018018018018018) internal successors, (289), 230 states have internal predecessors, (289), 39 states have call successors, (39), 12 states have call predecessors, (39), 20 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2024-10-10 22:30:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 397 transitions. [2024-10-10 22:30:08,176 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 397 transitions. Word has length 43 [2024-10-10 22:30:08,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:08,176 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 397 transitions. [2024-10-10 22:30:08,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:08,176 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 397 transitions. [2024-10-10 22:30:08,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 22:30:08,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:08,177 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:08,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:08,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 22:30:08,381 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:08,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:08,382 INFO L85 PathProgramCache]: Analyzing trace with hash -494549344, now seen corresponding path program 1 times [2024-10-10 22:30:08,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:08,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271369460] [2024-10-10 22:30:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-10 22:30:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-10 22:30:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:08,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271369460] [2024-10-10 22:30:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271369460] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341154920] [2024-10-10 22:30:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:08,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:08,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:08,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:08,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 22:30:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-10 22:30:08,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:08,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:08,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341154920] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:08,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:08,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 21 [2024-10-10 22:30:08,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609318193] [2024-10-10 22:30:08,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:08,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-10 22:30:08,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:08,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-10 22:30:08,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-10-10 22:30:08,973 INFO L87 Difference]: Start difference. First operand 282 states and 397 transitions. Second operand has 21 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-10 22:30:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:09,409 INFO L93 Difference]: Finished difference Result 435 states and 644 transitions. [2024-10-10 22:30:09,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-10 22:30:09,410 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 44 [2024-10-10 22:30:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:09,412 INFO L225 Difference]: With dead ends: 435 [2024-10-10 22:30:09,412 INFO L226 Difference]: Without dead ends: 401 [2024-10-10 22:30:09,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2024-10-10 22:30:09,415 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 239 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:09,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1343 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:30:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-10 22:30:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 283. [2024-10-10 22:30:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 221 states have (on average 1.2941176470588236) internal successors, (286), 231 states have internal predecessors, (286), 40 states have call successors, (40), 11 states have call predecessors, (40), 21 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-10-10 22:30:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 409 transitions. [2024-10-10 22:30:09,436 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 409 transitions. Word has length 44 [2024-10-10 22:30:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:09,436 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 409 transitions. [2024-10-10 22:30:09,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-10 22:30:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 409 transitions. [2024-10-10 22:30:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 22:30:09,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:09,438 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:09,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-10 22:30:09,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:09,642 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:09,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1803090472, now seen corresponding path program 1 times [2024-10-10 22:30:09,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:09,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83979205] [2024-10-10 22:30:09,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:09,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:09,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:09,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-10 22:30:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:30:10,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:10,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83979205] [2024-10-10 22:30:10,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83979205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:10,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314448545] [2024-10-10 22:30:10,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:10,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:10,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:10,048 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:10,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-10 22:30:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:30:10,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:30:10,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:10,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314448545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:10,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:10,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2024-10-10 22:30:10,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941547112] [2024-10-10 22:30:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:10,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:30:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:30:10,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2024-10-10 22:30:10,366 INFO L87 Difference]: Start difference. First operand 283 states and 409 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:10,465 INFO L93 Difference]: Finished difference Result 289 states and 414 transitions. [2024-10-10 22:30:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:30:10,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-10-10 22:30:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:10,470 INFO L225 Difference]: With dead ends: 289 [2024-10-10 22:30:10,470 INFO L226 Difference]: Without dead ends: 287 [2024-10-10 22:30:10,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2024-10-10 22:30:10,471 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 14 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:10,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 495 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-10 22:30:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-10-10 22:30:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 224 states have (on average 1.2901785714285714) internal successors, (289), 234 states have internal predecessors, (289), 40 states have call successors, (40), 12 states have call predecessors, (40), 22 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-10-10 22:30:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 412 transitions. [2024-10-10 22:30:10,494 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 412 transitions. Word has length 44 [2024-10-10 22:30:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:10,495 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 412 transitions. [2024-10-10 22:30:10,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 412 transitions. [2024-10-10 22:30:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 22:30:10,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:10,497 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:10,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:10,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 22:30:10,698 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:10,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:10,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1283058859, now seen corresponding path program 1 times [2024-10-10 22:30:10,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:10,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636251145] [2024-10-10 22:30:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-10 22:30:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:10,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:10,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636251145] [2024-10-10 22:30:10,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636251145] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:10,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133393572] [2024-10-10 22:30:10,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:10,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:10,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:10,844 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:10,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-10 22:30:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-10 22:30:10,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:11,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:11,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133393572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:11,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:11,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 18 [2024-10-10 22:30:11,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747352438] [2024-10-10 22:30:11,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:11,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-10 22:30:11,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-10 22:30:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-10 22:30:11,075 INFO L87 Difference]: Start difference. First operand 287 states and 412 transitions. Second operand has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-10 22:30:11,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:11,311 INFO L93 Difference]: Finished difference Result 375 states and 529 transitions. [2024-10-10 22:30:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-10 22:30:11,312 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-10-10 22:30:11,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:11,313 INFO L225 Difference]: With dead ends: 375 [2024-10-10 22:30:11,314 INFO L226 Difference]: Without dead ends: 305 [2024-10-10 22:30:11,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-10-10 22:30:11,315 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 68 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:11,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1174 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:30:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-10 22:30:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 289. [2024-10-10 22:30:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 225 states have (on average 1.28) internal successors, (288), 235 states have internal predecessors, (288), 40 states have call successors, (40), 13 states have call predecessors, (40), 23 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-10-10 22:30:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 411 transitions. [2024-10-10 22:30:11,363 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 411 transitions. Word has length 45 [2024-10-10 22:30:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:11,364 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 411 transitions. [2024-10-10 22:30:11,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-10 22:30:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 411 transitions. [2024-10-10 22:30:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 22:30:11,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:11,366 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:11,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-10 22:30:11,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-10 22:30:11,571 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:11,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash -988441476, now seen corresponding path program 1 times [2024-10-10 22:30:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:11,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73407137] [2024-10-10 22:30:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:30:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-10 22:30:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-10 22:30:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73407137] [2024-10-10 22:30:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73407137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275214819] [2024-10-10 22:30:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:11,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:11,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:11,789 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:11,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-10 22:30:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-10 22:30:11,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:11,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275214819] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:12,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:12,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-10-10 22:30:12,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568608849] [2024-10-10 22:30:12,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:12,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-10 22:30:12,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:12,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-10 22:30:12,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2024-10-10 22:30:12,182 INFO L87 Difference]: Start difference. First operand 289 states and 411 transitions. Second operand has 25 states, 19 states have (on average 2.526315789473684) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:30:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:12,707 INFO L93 Difference]: Finished difference Result 350 states and 520 transitions. [2024-10-10 22:30:12,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-10 22:30:12,708 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.526315789473684) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 49 [2024-10-10 22:30:12,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:12,709 INFO L225 Difference]: With dead ends: 350 [2024-10-10 22:30:12,709 INFO L226 Difference]: Without dead ends: 320 [2024-10-10 22:30:12,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-10-10 22:30:12,711 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 198 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:12,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 2039 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:30:12,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-10 22:30:12,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 277. [2024-10-10 22:30:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 217 states have (on average 1.2903225806451613) internal successors, (280), 226 states have internal predecessors, (280), 38 states have call successors, (38), 11 states have call predecessors, (38), 21 states have return successors, (79), 39 states have call predecessors, (79), 37 states have call successors, (79) [2024-10-10 22:30:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 397 transitions. [2024-10-10 22:30:12,729 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 397 transitions. Word has length 49 [2024-10-10 22:30:12,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:12,729 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 397 transitions. [2024-10-10 22:30:12,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.526315789473684) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:30:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 397 transitions. [2024-10-10 22:30:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 22:30:12,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:12,731 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:12,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:12,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 22:30:12,931 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:12,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:12,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1303146410, now seen corresponding path program 2 times [2024-10-10 22:30:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:12,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792437614] [2024-10-10 22:30:12,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-10 22:30:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-10 22:30:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-10 22:30:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792437614] [2024-10-10 22:30:13,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792437614] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:13,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738846935] [2024-10-10 22:30:13,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:30:13,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:13,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:13,150 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:13,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-10 22:30:13,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:30:13,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:13,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-10 22:30:13,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:13,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738846935] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:14,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:14,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 13] total 36 [2024-10-10 22:30:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806172459] [2024-10-10 22:30:14,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:14,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-10 22:30:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:14,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-10 22:30:14,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2024-10-10 22:30:14,512 INFO L87 Difference]: Start difference. First operand 277 states and 397 transitions. Second operand has 36 states, 27 states have (on average 2.111111111111111) internal successors, (57), 29 states have internal predecessors, (57), 6 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-10 22:30:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:15,819 INFO L93 Difference]: Finished difference Result 387 states and 616 transitions. [2024-10-10 22:30:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-10 22:30:15,820 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 2.111111111111111) internal successors, (57), 29 states have internal predecessors, (57), 6 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 49 [2024-10-10 22:30:15,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:15,822 INFO L225 Difference]: With dead ends: 387 [2024-10-10 22:30:15,822 INFO L226 Difference]: Without dead ends: 349 [2024-10-10 22:30:15,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2024-10-10 22:30:15,824 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 158 mSDsluCounter, 3520 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 3651 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:15,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 3651 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:30:15,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-10 22:30:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 269. [2024-10-10 22:30:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 210 states have (on average 1.3) internal successors, (273), 221 states have internal predecessors, (273), 37 states have call successors, (37), 9 states have call predecessors, (37), 21 states have return successors, (78), 38 states have call predecessors, (78), 36 states have call successors, (78) [2024-10-10 22:30:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 388 transitions. [2024-10-10 22:30:15,848 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 388 transitions. Word has length 49 [2024-10-10 22:30:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:15,849 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 388 transitions. [2024-10-10 22:30:15,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 2.111111111111111) internal successors, (57), 29 states have internal predecessors, (57), 6 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-10 22:30:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 388 transitions. [2024-10-10 22:30:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-10 22:30:15,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:15,854 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:15,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:16,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:16,055 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:16,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1166570143, now seen corresponding path program 1 times [2024-10-10 22:30:16,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:16,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249653295] [2024-10-10 22:30:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:16,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-10 22:30:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-10 22:30:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:30:16,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:16,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249653295] [2024-10-10 22:30:16,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249653295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:16,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:16,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-10 22:30:16,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491150111] [2024-10-10 22:30:16,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:16,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:30:16,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:16,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:30:16,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:16,258 INFO L87 Difference]: Start difference. First operand 269 states and 388 transitions. Second operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:16,382 INFO L93 Difference]: Finished difference Result 455 states and 645 transitions. [2024-10-10 22:30:16,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:30:16,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2024-10-10 22:30:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:16,385 INFO L225 Difference]: With dead ends: 455 [2024-10-10 22:30:16,385 INFO L226 Difference]: Without dead ends: 282 [2024-10-10 22:30:16,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:30:16,388 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 58 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:16,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 706 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-10 22:30:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 269. [2024-10-10 22:30:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 221 states have internal predecessors, (271), 37 states have call successors, (37), 9 states have call predecessors, (37), 21 states have return successors, (78), 38 states have call predecessors, (78), 36 states have call successors, (78) [2024-10-10 22:30:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 386 transitions. [2024-10-10 22:30:16,412 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 386 transitions. Word has length 50 [2024-10-10 22:30:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:16,412 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 386 transitions. [2024-10-10 22:30:16,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 386 transitions. [2024-10-10 22:30:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-10 22:30:16,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:16,413 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:16,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 22:30:16,414 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:16,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:16,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1777007429, now seen corresponding path program 1 times [2024-10-10 22:30:16,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:16,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277032919] [2024-10-10 22:30:16,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:16,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-10 22:30:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:30:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277032919] [2024-10-10 22:30:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277032919] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376918981] [2024-10-10 22:30:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:16,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:16,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:16,520 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:16,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-10 22:30:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-10 22:30:16,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:16,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:30:16,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376918981] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:16,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:16,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2024-10-10 22:30:16,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398086411] [2024-10-10 22:30:16,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:16,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-10 22:30:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:16,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-10 22:30:16,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-10 22:30:16,732 INFO L87 Difference]: Start difference. First operand 269 states and 386 transitions. Second operand has 15 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-10 22:30:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:16,842 INFO L93 Difference]: Finished difference Result 393 states and 551 transitions. [2024-10-10 22:30:16,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:30:16,843 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2024-10-10 22:30:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:16,845 INFO L225 Difference]: With dead ends: 393 [2024-10-10 22:30:16,845 INFO L226 Difference]: Without dead ends: 315 [2024-10-10 22:30:16,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:30:16,846 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 114 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:16,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1113 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-10 22:30:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2024-10-10 22:30:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 239 states have (on average 1.301255230125523) internal successors, (311), 252 states have internal predecessors, (311), 40 states have call successors, (40), 10 states have call predecessors, (40), 24 states have return successors, (79), 41 states have call predecessors, (79), 39 states have call successors, (79) [2024-10-10 22:30:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2024-10-10 22:30:16,868 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 50 [2024-10-10 22:30:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:16,869 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2024-10-10 22:30:16,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-10 22:30:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2024-10-10 22:30:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-10 22:30:16,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:16,870 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:16,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:17,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-10 22:30:17,071 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:17,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:17,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1496891513, now seen corresponding path program 2 times [2024-10-10 22:30:17,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:17,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553639043] [2024-10-10 22:30:17,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:17,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:17,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:17,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:17,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:17,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-10 22:30:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:30:17,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:17,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553639043] [2024-10-10 22:30:17,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553639043] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:17,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609341306] [2024-10-10 22:30:17,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:30:17,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:17,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:17,250 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:17,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-10 22:30:17,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:30:17,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:17,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-10 22:30:17,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:17,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:30:17,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609341306] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:17,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:17,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-10 22:30:17,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020485174] [2024-10-10 22:30:17,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:17,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-10 22:30:17,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:17,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-10 22:30:17,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:30:17,482 INFO L87 Difference]: Start difference. First operand 304 states and 430 transitions. Second operand has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-10 22:30:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:17,689 INFO L93 Difference]: Finished difference Result 524 states and 737 transitions. [2024-10-10 22:30:17,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-10 22:30:17,690 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2024-10-10 22:30:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:17,693 INFO L225 Difference]: With dead ends: 524 [2024-10-10 22:30:17,693 INFO L226 Difference]: Without dead ends: 343 [2024-10-10 22:30:17,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:30:17,694 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 133 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:17,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1206 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-10 22:30:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 304. [2024-10-10 22:30:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 239 states have (on average 1.292887029288703) internal successors, (309), 252 states have internal predecessors, (309), 40 states have call successors, (40), 10 states have call predecessors, (40), 24 states have return successors, (79), 41 states have call predecessors, (79), 39 states have call successors, (79) [2024-10-10 22:30:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 428 transitions. [2024-10-10 22:30:17,717 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 428 transitions. Word has length 50 [2024-10-10 22:30:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:17,717 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 428 transitions. [2024-10-10 22:30:17,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-10 22:30:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 428 transitions. [2024-10-10 22:30:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-10 22:30:17,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:17,719 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:17,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:17,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:17,919 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:17,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash -814828544, now seen corresponding path program 1 times [2024-10-10 22:30:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:17,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463725361] [2024-10-10 22:30:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:17,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:30:17,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 22:30:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:30:18,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-10 22:30:18,020 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 22:30:18,022 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:30:18,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 22:30:18,026 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:18,060 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:30:18,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:30:18 BoogieIcfgContainer [2024-10-10 22:30:18,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:30:18,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:30:18,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:30:18,066 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:30:18,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:56" (3/4) ... [2024-10-10 22:30:18,068 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-10 22:30:18,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:30:18,072 INFO L158 Benchmark]: Toolchain (without parser) took 23021.30ms. Allocated memory was 159.4MB in the beginning and 390.1MB in the end (delta: 230.7MB). Free memory was 102.7MB in the beginning and 239.0MB in the end (delta: -136.3MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:18,072 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:30:18,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.40ms. Allocated memory is still 159.4MB. Free memory was 102.1MB in the beginning and 87.5MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 22:30:18,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.65ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 86.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:18,073 INFO L158 Benchmark]: Boogie Preprocessor took 66.22ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 83.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:18,073 INFO L158 Benchmark]: RCFGBuilder took 502.96ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 62.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-10 22:30:18,073 INFO L158 Benchmark]: TraceAbstraction took 22046.74ms. Allocated memory was 159.4MB in the beginning and 390.1MB in the end (delta: 230.7MB). Free memory was 62.3MB in the beginning and 240.0MB in the end (delta: -177.7MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2024-10-10 22:30:18,073 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 390.1MB. Free memory was 240.0MB in the beginning and 239.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:18,074 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.40ms. Allocated memory is still 159.4MB. Free memory was 102.1MB in the beginning and 87.5MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.65ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 86.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.22ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 83.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 502.96ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 62.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22046.74ms. Allocated memory was 159.4MB in the beginning and 390.1MB in the end (delta: 230.7MB). Free memory was 62.3MB in the beginning and 240.0MB in the end (delta: -177.7MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 390.1MB. Free memory was 240.0MB in the beginning and 239.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: 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 110, overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=-127, eb=127] [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); [L241] RET, EXPR base2flt(0, 0) VAL [ea=-127, eb=127] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=4311744512] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m)=4311744512] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=4311744512, __retres4=16777216] [L80] return (__retres4); [L242] RET, EXPR base2flt(ma, ea) VAL [ea=-127, eb=127, ma=4311744512] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L80] return (__retres4); [L243] RET, EXPR base2flt(mb, eb) VAL [a=16777216, ea=-127, eb=127, ma=4311744512, mb=33554432] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=16777216, \old(b)=4294967295] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=16777216, \old(b)=4294967295, a=16777216, b=4294967295] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, b=16777216] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, b=16777216, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, b=16777216, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, ea=127, eb=-127, ma=16777216, mb=0] [L113] EXPR mb | (1U << 24U) VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, ea=127, eb=-127, ma=16777216] [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, ea=127, eb=-127, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, delta=254, ea=127, ma=16777216, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2232 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2064 mSDsluCounter, 28592 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26177 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7023 IncrementalHoareTripleChecker+Invalid, 7336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 2415 mSDtfsCounter, 7023 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1544 GetRequests, 1105 SyntacticMatches, 6 SemanticMatches, 433 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=11, InterpolantAutomatonStates: 324, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 829 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1627 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1924 ConstructedInterpolants, 1 QuantifiedInterpolants, 4638 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2131 ConjunctsInSsa, 320 ConjunctsInUnsatCore, 46 InterpolantComputations, 13 PerfectInterpolantSequences, 631/738 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-10 22:30:18,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:30:20,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:30:20,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-10 22:30:20,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:30:20,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:30:20,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:30:20,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:30:20,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:30:20,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:30:20,517 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:30:20,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:30:20,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:30:20,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:30:20,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:30:20,520 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:30:20,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:30:20,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:30:20,521 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:30:20,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:30:20,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:30:20,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:30:20,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:30:20,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:30:20,527 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-10 22:30:20,527 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-10 22:30:20,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:30:20,527 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-10 22:30:20,528 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:30:20,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:30:20,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:30:20,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:30:20,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:30:20,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:30:20,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:30:20,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:20,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:30:20,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:30:20,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:30:20,533 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-10 22:30:20,533 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-10 22:30:20,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:30:20,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:30:20,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:30:20,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:30:20,535 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-10 22:30:20,535 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-10-10 22:30:20,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:30:20,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:30:20,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:30:20,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:30:20,895 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:30:20,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-10-10 22:30:22,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:30:22,721 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:30:22,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-10-10 22:30:22,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/09b4b5674/c7e2f50db338418880143904815831ed/FLAG1eeffbe7f [2024-10-10 22:30:23,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/09b4b5674/c7e2f50db338418880143904815831ed [2024-10-10 22:30:23,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:30:23,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:30:23,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:23,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:30:23,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:30:23,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a5311b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23, skipping insertion in model container [2024-10-10 22:30:23,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:30:23,286 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/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-10-10 22:30:23,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:23,362 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:30:23,374 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/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-10-10 22:30:23,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:23,422 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:30:23,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23 WrapperNode [2024-10-10 22:30:23,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:23,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:23,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:30:23,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:30:23,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,459 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-10-10 22:30:23,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:23,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:30:23,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:30:23,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:30:23,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,498 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:30:23,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:30:23,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:30:23,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:30:23,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:30:23,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (1/1) ... [2024-10-10 22:30:23,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:23,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:23,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:30:23,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:30:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:30:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-10 22:30:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-10 22:30:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-10 22:30:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:30:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:30:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-10-10 22:30:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-10-10 22:30:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-10 22:30:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-10 22:30:23,706 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:30:23,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:30:23,985 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-10 22:30:23,985 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:30:24,025 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:30:24,028 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 22:30:24,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:24 BoogieIcfgContainer [2024-10-10 22:30:24,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:30:24,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:30:24,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:30:24,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:30:24,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:30:23" (1/3) ... [2024-10-10 22:30:24,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d10d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:24, skipping insertion in model container [2024-10-10 22:30:24,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:23" (2/3) ... [2024-10-10 22:30:24,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d10d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:24, skipping insertion in model container [2024-10-10 22:30:24,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:24" (3/3) ... [2024-10-10 22:30:24,041 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-10-10 22:30:24,059 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:30:24,059 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:30:24,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:30:24,120 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;@1952b0d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:30:24,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:30:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-10 22:30:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:30:24,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:24,129 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:24,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:24,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:24,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2129999647, now seen corresponding path program 1 times [2024-10-10 22:30:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:24,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429958281] [2024-10-10 22:30:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:24,145 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-10 22:30:24,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:24,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:24,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-10 22:30:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:24,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:30:24,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:24,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:24,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:24,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429958281] [2024-10-10 22:30:24,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429958281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:24,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:24,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-10 22:30:24,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879308014] [2024-10-10 22:30:24,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:24,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 22:30:24,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:24,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 22:30:24,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:30:24,422 INFO L87 Difference]: Start difference. First operand has 49 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:24,577 INFO L93 Difference]: Finished difference Result 113 states and 178 transitions. [2024-10-10 22:30:24,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:30:24,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-10 22:30:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:24,592 INFO L225 Difference]: With dead ends: 113 [2024-10-10 22:30:24,593 INFO L226 Difference]: Without dead ends: 63 [2024-10-10 22:30:24,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:24,602 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 12 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:24,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 400 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-10 22:30:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2024-10-10 22:30:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.35) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-10 22:30:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-10-10 22:30:24,642 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 27 [2024-10-10 22:30:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:24,643 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-10-10 22:30:24,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-10-10 22:30:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 22:30:24,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:24,645 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-10 22:30:24,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-10 22:30:24,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:24,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:24,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:24,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1461087604, now seen corresponding path program 1 times [2024-10-10 22:30:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:24,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140531689] [2024-10-10 22:30:24,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:24,848 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-10 22:30:24,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:24,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:24,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-10 22:30:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:24,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 22:30:24,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:25,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:25,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140531689] [2024-10-10 22:30:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140531689] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:25,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:25,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-10-10 22:30:25,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187675376] [2024-10-10 22:30:25,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:25,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:30:25,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:25,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:30:25,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:25,082 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:25,221 INFO L93 Difference]: Finished difference Result 107 states and 145 transitions. [2024-10-10 22:30:25,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:30:25,224 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-10-10 22:30:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:25,227 INFO L225 Difference]: With dead ends: 107 [2024-10-10 22:30:25,227 INFO L226 Difference]: Without dead ends: 80 [2024-10-10 22:30:25,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:30:25,231 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 14 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:25,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 447 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-10 22:30:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2024-10-10 22:30:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.326086956521739) internal successors, (61), 48 states have internal predecessors, (61), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-10 22:30:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2024-10-10 22:30:25,256 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 31 [2024-10-10 22:30:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:25,256 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2024-10-10 22:30:25,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2024-10-10 22:30:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 22:30:25,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:25,258 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-10 22:30:25,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-10 22:30:25,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:25,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:25,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:25,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1786129759, now seen corresponding path program 1 times [2024-10-10 22:30:25,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:25,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723394086] [2024-10-10 22:30:25,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:25,464 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-10 22:30:25,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:25,469 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:25,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-10 22:30:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:25,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:30:25,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:25,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:25,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:25,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723394086] [2024-10-10 22:30:25,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723394086] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:25,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:25,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-10 22:30:25,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976107974] [2024-10-10 22:30:25,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:25,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 22:30:25,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:25,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 22:30:25,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:30:25,630 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:25,737 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2024-10-10 22:30:25,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:30:25,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-10-10 22:30:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:25,739 INFO L225 Difference]: With dead ends: 102 [2024-10-10 22:30:25,739 INFO L226 Difference]: Without dead ends: 79 [2024-10-10 22:30:25,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:25,740 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 11 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:25,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 408 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-10 22:30:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2024-10-10 22:30:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 54 states have internal predecessors, (67), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-10 22:30:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2024-10-10 22:30:25,754 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 34 [2024-10-10 22:30:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:25,754 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2024-10-10 22:30:25,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:25,755 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2024-10-10 22:30:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:30:25,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:25,758 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:25,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-10 22:30:25,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:25,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:25,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash -867370505, now seen corresponding path program 2 times [2024-10-10 22:30:25,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:25,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293320951] [2024-10-10 22:30:25,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:30:25,962 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-10 22:30:25,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:25,964 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:25,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-10 22:30:26,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-10 22:30:26,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:26,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 22:30:26,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:26,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:26,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:26,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293320951] [2024-10-10 22:30:26,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293320951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:26,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:26,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:30:26,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199908607] [2024-10-10 22:30:26,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:26,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:26,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:26,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:26,132 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:26,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:26,257 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2024-10-10 22:30:26,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:26,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-10 22:30:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:26,261 INFO L225 Difference]: With dead ends: 84 [2024-10-10 22:30:26,261 INFO L226 Difference]: Without dead ends: 82 [2024-10-10 22:30:26,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:30:26,264 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 3 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 283 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-10 22:30:26,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 283 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-10 22:30:26,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-10-10 22:30:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 59 states have internal predecessors, (72), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2024-10-10 22:30:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2024-10-10 22:30:26,282 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 35 [2024-10-10 22:30:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:26,283 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2024-10-10 22:30:26,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2024-10-10 22:30:26,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:30:26,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:26,285 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:26,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:26,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:26,487 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:26,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:26,488 INFO L85 PathProgramCache]: Analyzing trace with hash -810112203, now seen corresponding path program 1 times [2024-10-10 22:30:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:26,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212370842] [2024-10-10 22:30:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:26,489 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-10 22:30:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:26,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:26,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-10 22:30:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:26,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:30:26,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:26,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:26,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:26,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212370842] [2024-10-10 22:30:26,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212370842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:26,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:26,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:30:26,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382219875] [2024-10-10 22:30:26,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:26,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:26,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:26,702 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:26,805 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2024-10-10 22:30:26,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:26,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-10 22:30:26,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:26,808 INFO L225 Difference]: With dead ends: 86 [2024-10-10 22:30:26,808 INFO L226 Difference]: Without dead ends: 84 [2024-10-10 22:30:26,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:30:26,809 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 3 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:26,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 278 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:26,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-10 22:30:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-10-10 22:30:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 57 states have internal predecessors, (70), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-10 22:30:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-10-10 22:30:26,824 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 35 [2024-10-10 22:30:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:26,824 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-10-10 22:30:26,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-10-10 22:30:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:30:26,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:26,826 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-10 22:30:26,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-10 22:30:27,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:27,031 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:27,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:27,032 INFO L85 PathProgramCache]: Analyzing trace with hash -899164875, now seen corresponding path program 1 times [2024-10-10 22:30:27,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:27,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772582382] [2024-10-10 22:30:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:27,032 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-10 22:30:27,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:27,036 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:27,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-10 22:30:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:27,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-10 22:30:27,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:27,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:27,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:27,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772582382] [2024-10-10 22:30:27,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772582382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:27,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:27,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-10 22:30:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591825329] [2024-10-10 22:30:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:27,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:30:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:27,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:30:27,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:30:27,205 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:30:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:27,436 INFO L93 Difference]: Finished difference Result 114 states and 153 transitions. [2024-10-10 22:30:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-10 22:30:27,437 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-10-10 22:30:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:27,439 INFO L225 Difference]: With dead ends: 114 [2024-10-10 22:30:27,440 INFO L226 Difference]: Without dead ends: 107 [2024-10-10 22:30:27,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:30:27,441 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 21 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:27,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 607 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:30:27,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-10 22:30:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 92. [2024-10-10 22:30:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.265625) internal successors, (81), 66 states have internal predecessors, (81), 18 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2024-10-10 22:30:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2024-10-10 22:30:27,459 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 38 [2024-10-10 22:30:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:27,460 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2024-10-10 22:30:27,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:30:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2024-10-10 22:30:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:30:27,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:27,462 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-10 22:30:27,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:27,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:27,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:27,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:27,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1049521637, now seen corresponding path program 1 times [2024-10-10 22:30:27,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:27,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347059684] [2024-10-10 22:30:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:27,664 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-10 22:30:27,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:27,665 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:27,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-10 22:30:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:27,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-10 22:30:27,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:27,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:27,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347059684] [2024-10-10 22:30:27,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347059684] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:27,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:27,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2024-10-10 22:30:27,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097449570] [2024-10-10 22:30:27,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:27,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 22:30:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:27,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 22:30:27,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:30:27,981 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:30:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:28,231 INFO L93 Difference]: Finished difference Result 121 states and 161 transitions. [2024-10-10 22:30:28,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-10 22:30:28,232 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-10-10 22:30:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:28,234 INFO L225 Difference]: With dead ends: 121 [2024-10-10 22:30:28,234 INFO L226 Difference]: Without dead ends: 113 [2024-10-10 22:30:28,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:30:28,235 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 22 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:28,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 773 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:30:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-10 22:30:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2024-10-10 22:30:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 19 states have call successors, (19), 7 states have call predecessors, (19), 10 states have return successors, (26), 21 states have call predecessors, (26), 18 states have call successors, (26) [2024-10-10 22:30:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2024-10-10 22:30:28,257 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 40 [2024-10-10 22:30:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:28,257 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2024-10-10 22:30:28,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:30:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2024-10-10 22:30:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:30:28,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:28,260 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-10 22:30:28,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-10 22:30:28,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:28,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:28,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash -992263335, now seen corresponding path program 1 times [2024-10-10 22:30:28,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:28,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8072187] [2024-10-10 22:30:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:28,462 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-10 22:30:28,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:28,465 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:28,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-10 22:30:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:28,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:30:28,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:30:28,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:28,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:28,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8072187] [2024-10-10 22:30:28,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8072187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:28,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:28,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:30:28,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005142362] [2024-10-10 22:30:28,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:28,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:28,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:28,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:28,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:28,556 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-10 22:30:28,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:28,613 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2024-10-10 22:30:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:28,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2024-10-10 22:30:28,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:28,615 INFO L225 Difference]: With dead ends: 110 [2024-10-10 22:30:28,616 INFO L226 Difference]: Without dead ends: 95 [2024-10-10 22:30:28,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:30:28,617 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 3 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:28,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 288 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-10 22:30:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-10 22:30:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 69 states have internal predecessors, (83), 17 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2024-10-10 22:30:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2024-10-10 22:30:28,635 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 40 [2024-10-10 22:30:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:28,636 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2024-10-10 22:30:28,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-10 22:30:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2024-10-10 22:30:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 22:30:28,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:28,638 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:28,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:28,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:28,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:28,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1844658447, now seen corresponding path program 1 times [2024-10-10 22:30:28,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:28,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079190827] [2024-10-10 22:30:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:28,841 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-10 22:30:28,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:28,842 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:28,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-10 22:30:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:28,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 22:30:28,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-10 22:30:28,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:28,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:28,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079190827] [2024-10-10 22:30:28,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079190827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:28,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:28,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-10 22:30:28,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383852671] [2024-10-10 22:30:28,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:28,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:30:28,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:28,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:30:28,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:28,955 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:30:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:29,065 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2024-10-10 22:30:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:30:29,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2024-10-10 22:30:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:29,067 INFO L225 Difference]: With dead ends: 143 [2024-10-10 22:30:29,067 INFO L226 Difference]: Without dead ends: 108 [2024-10-10 22:30:29,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:30:29,068 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 11 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:29,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 545 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-10 22:30:29,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2024-10-10 22:30:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 70 states have internal predecessors, (83), 15 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (19), 16 states have call predecessors, (19), 14 states have call successors, (19) [2024-10-10 22:30:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2024-10-10 22:30:29,077 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 44 [2024-10-10 22:30:29,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:29,077 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2024-10-10 22:30:29,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:30:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2024-10-10 22:30:29,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-10 22:30:29,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:29,079 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:29,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-10 22:30:29,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:29,282 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:29,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:29,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2074234608, now seen corresponding path program 1 times [2024-10-10 22:30:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:29,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337925533] [2024-10-10 22:30:29,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:29,283 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-10 22:30:29,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:29,284 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:29,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-10 22:30:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:30:29,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 22:30:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:30:29,387 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-10 22:30:29,387 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 22:30:29,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:30:29,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-10 22:30:29,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:29,593 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:29,625 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:30:29,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:30:29 BoogieIcfgContainer [2024-10-10 22:30:29,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:30:29,628 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:30:29,628 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:30:29,628 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:30:29,628 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:24" (3/4) ... [2024-10-10 22:30:29,629 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-10 22:30:29,678 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:30:29,680 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:30:29,681 INFO L158 Benchmark]: Toolchain (without parser) took 6610.05ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 54.4MB in the beginning and 71.5MB in the end (delta: -17.1MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-10-10 22:30:29,681 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 50.3MB. Free memory was 30.7MB in the beginning and 30.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:30:29,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.46ms. Allocated memory is still 77.6MB. Free memory was 54.4MB in the beginning and 39.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 22:30:29,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.52ms. Allocated memory is still 77.6MB. Free memory was 39.4MB in the beginning and 37.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:29,682 INFO L158 Benchmark]: Boogie Preprocessor took 68.05ms. Allocated memory is still 77.6MB. Free memory was 37.6MB in the beginning and 35.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:29,682 INFO L158 Benchmark]: RCFGBuilder took 498.12ms. Allocated memory is still 77.6MB. Free memory was 35.5MB in the beginning and 43.6MB in the end (delta: -8.1MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:29,682 INFO L158 Benchmark]: TraceAbstraction took 5596.89ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 42.9MB in the beginning and 74.9MB in the end (delta: -32.1MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:29,682 INFO L158 Benchmark]: Witness Printer took 52.22ms. Allocated memory is still 98.6MB. Free memory was 74.9MB in the beginning and 71.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-10 22:30:29,684 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.25ms. Allocated memory is still 50.3MB. Free memory was 30.7MB in the beginning and 30.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.46ms. Allocated memory is still 77.6MB. Free memory was 54.4MB in the beginning and 39.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.52ms. Allocated memory is still 77.6MB. Free memory was 39.4MB in the beginning and 37.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.05ms. Allocated memory is still 77.6MB. Free memory was 37.6MB in the beginning and 35.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 498.12ms. Allocated memory is still 77.6MB. Free memory was 35.5MB in the beginning and 43.6MB in the end (delta: -8.1MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5596.89ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 42.9MB in the beginning and 74.9MB in the end (delta: -32.1MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Witness Printer took 52.22ms. Allocated memory is still 98.6MB. Free memory was 74.9MB in the beginning and 71.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); [L241] RET, EXPR base2flt(0, 0) [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=-2147483648] [L80] return (__retres4); [L242] RET, EXPR base2flt(ma, ea) VAL [ea=0, ma=16777216] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=-1073741824] [L80] return (__retres4); [L243] RET, EXPR base2flt(mb, eb) VAL [a=-2147483648, ea=0, eb=64, ma=16777216, mb=16777216] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=-2147483648, \old(b)=-1073741824] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-2147483648, b=-1073741824] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, b=-2147483648] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, delta=64, ea=64, ma=16777216, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 4029 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3476 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 928 IncrementalHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 553 mSDtfsCounter, 928 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 432 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=7, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 74 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 365 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 417 ConstructedInterpolants, 2 QuantifiedInterpolants, 689 SizeOfPredicates, 13 NumberOfNonLiveVariables, 663 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 163/183 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 proved your program to be incorrect! [2024-10-10 22:30:29,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE