./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:02:01,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:02:01,467 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:02:01,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:02:01,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:02:01,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:02:01,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:02:01,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:02:01,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:02:01,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:02:01,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:02:01,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:02:01,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:02:01,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:02:01,509 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:02:01,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:02:01,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:02:01,510 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:02:01,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:02:01,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:02:01,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:02:01,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:02:01,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:02:01,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:02:01,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:02:01,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:02:01,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:02:01,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:02:01,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:02:01,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:02:01,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:02:01,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:02:01,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:02:01,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:02:01,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:02:01,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:02:01,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:02:01,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:02:01,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:02:01,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:02:01,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:02:01,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:02:01,524 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 [2024-11-20 09:02:01,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:02:01,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:02:01,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:02:01,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:02:01,810 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:02:01,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i [2024-11-20 09:02:03,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:02:03,502 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:02:03,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i [2024-11-20 09:02:03,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54647c43f/da195134b2ef481e9c1dfaaadf9935e0/FLAGd036817a2 [2024-11-20 09:02:03,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54647c43f/da195134b2ef481e9c1dfaaadf9935e0 [2024-11-20 09:02:03,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:02:03,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:02:03,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:02:03,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:02:03,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:02:03,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:02:03" (1/1) ... [2024-11-20 09:02:03,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e319300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:03, skipping insertion in model container [2024-11-20 09:02:03,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:02:03" (1/1) ... [2024-11-20 09:02:03,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:02:04,067 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i[916,929] [2024-11-20 09:02:04,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:02:04,151 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:02:04,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i[916,929] [2024-11-20 09:02:04,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:02:04,234 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:02:04,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04 WrapperNode [2024-11-20 09:02:04,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:02:04,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:02:04,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:02:04,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:02:04,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,288 INFO L138 Inliner]: procedures = 27, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 408 [2024-11-20 09:02:04,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:02:04,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:02:04,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:02:04,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:02:04,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,330 INFO L175 MemorySlicer]: Split 120 memory accesses to 2 slices as follows [2, 118]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-20 09:02:04,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:02:04,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:02:04,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:02:04,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:02:04,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:02:04,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:02:04,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 09:02:04,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 09:02:04,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:02:04,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-20 09:02:04,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-20 09:02:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 09:02:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 09:02:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 09:02:04,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 09:02:04,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:02:04,480 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:02:04,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 09:02:04,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 09:02:04,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:02:04,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:02:04,601 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:02:04,604 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:02:05,020 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-20 09:02:05,020 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:02:05,035 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:02:05,036 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:02:05,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:02:05 BoogieIcfgContainer [2024-11-20 09:02:05,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:02:05,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:02:05,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:02:05,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:02:05,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:02:03" (1/3) ... [2024-11-20 09:02:05,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e99d274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:02:05, skipping insertion in model container [2024-11-20 09:02:05,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (2/3) ... [2024-11-20 09:02:05,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e99d274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:02:05, skipping insertion in model container [2024-11-20 09:02:05,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:02:05" (3/3) ... [2024-11-20 09:02:05,048 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-87.i [2024-11-20 09:02:05,066 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:02:05,066 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:02:05,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:02:05,134 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;@33b8c1c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:02:05,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:02:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 71 states have internal predecessors, (96), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:02:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 09:02:05,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:05,151 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:05,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:05,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:05,157 INFO L85 PathProgramCache]: Analyzing trace with hash -160032552, now seen corresponding path program 1 times [2024-11-20 09:02:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:05,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29189147] [2024-11-20 09:02:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:05,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:05,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29189147] [2024-11-20 09:02:05,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29189147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:05,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:05,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:02:05,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552483528] [2024-11-20 09:02:05,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:05,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:02:05,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:05,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:02:05,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:02:05,693 INFO L87 Difference]: Start difference. First operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 71 states have internal predecessors, (96), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:02:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:05,725 INFO L93 Difference]: Finished difference Result 167 states and 256 transitions. [2024-11-20 09:02:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:02:05,728 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-11-20 09:02:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:05,736 INFO L225 Difference]: With dead ends: 167 [2024-11-20 09:02:05,737 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 09:02:05,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:02:05,744 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:05,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 09:02:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-20 09:02:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:02:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2024-11-20 09:02:05,795 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 111 [2024-11-20 09:02:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:05,795 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2024-11-20 09:02:05,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:02:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2024-11-20 09:02:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 09:02:05,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:05,799 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:05,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:02:05,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:05,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:05,801 INFO L85 PathProgramCache]: Analyzing trace with hash -173670212, now seen corresponding path program 1 times [2024-11-20 09:02:05,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:05,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145003200] [2024-11-20 09:02:05,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:05,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:06,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:06,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145003200] [2024-11-20 09:02:06,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145003200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:06,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:06,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:02:06,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030876770] [2024-11-20 09:02:06,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:06,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:02:06,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:06,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:02:06,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:06,330 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:06,376 INFO L93 Difference]: Finished difference Result 165 states and 230 transitions. [2024-11-20 09:02:06,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:02:06,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-11-20 09:02:06,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:06,381 INFO L225 Difference]: With dead ends: 165 [2024-11-20 09:02:06,381 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 09:02:06,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:06,385 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:06,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 09:02:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-20 09:02:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:02:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-11-20 09:02:06,404 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 111 [2024-11-20 09:02:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:06,407 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-11-20 09:02:06,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-11-20 09:02:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 09:02:06,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:06,410 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:06,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:02:06,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:06,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:06,412 INFO L85 PathProgramCache]: Analyzing trace with hash -95122987, now seen corresponding path program 1 times [2024-11-20 09:02:06,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:06,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93128287] [2024-11-20 09:02:06,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:06,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:06,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:06,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93128287] [2024-11-20 09:02:06,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93128287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:06,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:06,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:02:06,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71634039] [2024-11-20 09:02:06,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:06,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:02:06,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:06,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:02:06,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:06,690 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:06,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:06,736 INFO L93 Difference]: Finished difference Result 170 states and 235 transitions. [2024-11-20 09:02:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:02:06,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-20 09:02:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:06,739 INFO L225 Difference]: With dead ends: 170 [2024-11-20 09:02:06,741 INFO L226 Difference]: Without dead ends: 88 [2024-11-20 09:02:06,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:06,743 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:06,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:06,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-20 09:02:06,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-20 09:02:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:02:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-11-20 09:02:06,757 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 113 [2024-11-20 09:02:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:06,758 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-11-20 09:02:06,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-11-20 09:02:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 09:02:06,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:06,761 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:06,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:02:06,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:06,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash 584935383, now seen corresponding path program 1 times [2024-11-20 09:02:06,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:06,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937989332] [2024-11-20 09:02:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:06,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:06,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937989332] [2024-11-20 09:02:06,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937989332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:06,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:06,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:02:06,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938389934] [2024-11-20 09:02:06,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:06,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:02:06,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:06,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:02:06,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:06,943 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:06,982 INFO L93 Difference]: Finished difference Result 174 states and 239 transitions. [2024-11-20 09:02:06,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:02:06,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-20 09:02:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:06,985 INFO L225 Difference]: With dead ends: 174 [2024-11-20 09:02:06,985 INFO L226 Difference]: Without dead ends: 90 [2024-11-20 09:02:06,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:06,988 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:06,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 326 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:06,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-20 09:02:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-20 09:02:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:02:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-11-20 09:02:06,998 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 113 [2024-11-20 09:02:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:06,999 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-11-20 09:02:06,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-11-20 09:02:07,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 09:02:07,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:07,002 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:07,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:02:07,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:07,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:07,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1935024551, now seen corresponding path program 1 times [2024-11-20 09:02:07,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:07,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383913900] [2024-11-20 09:02:07,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:07,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:07,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:07,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383913900] [2024-11-20 09:02:07,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383913900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:07,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:07,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:02:07,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861596270] [2024-11-20 09:02:07,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:07,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:02:07,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:07,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:02:07,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:07,159 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:07,182 INFO L93 Difference]: Finished difference Result 178 states and 243 transitions. [2024-11-20 09:02:07,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:02:07,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-20 09:02:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:07,185 INFO L225 Difference]: With dead ends: 178 [2024-11-20 09:02:07,185 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 09:02:07,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:07,188 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:07,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 09:02:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-20 09:02:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:02:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-11-20 09:02:07,200 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 113 [2024-11-20 09:02:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:07,201 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-11-20 09:02:07,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-11-20 09:02:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 09:02:07,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:07,206 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:07,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:02:07,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:07,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1933177509, now seen corresponding path program 1 times [2024-11-20 09:02:07,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:07,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472211978] [2024-11-20 09:02:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:07,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:07,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472211978] [2024-11-20 09:02:07,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472211978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:07,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:07,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:02:07,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275417507] [2024-11-20 09:02:07,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:07,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:02:07,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:07,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:02:07,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:07,930 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:02:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:08,341 INFO L93 Difference]: Finished difference Result 260 states and 354 transitions. [2024-11-20 09:02:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:02:08,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-11-20 09:02:08,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:08,343 INFO L225 Difference]: With dead ends: 260 [2024-11-20 09:02:08,343 INFO L226 Difference]: Without dead ends: 172 [2024-11-20 09:02:08,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:02:08,344 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 147 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:08,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 320 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:02:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-20 09:02:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 103. [2024-11-20 09:02:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:02:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2024-11-20 09:02:08,362 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 113 [2024-11-20 09:02:08,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:08,362 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2024-11-20 09:02:08,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:02:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2024-11-20 09:02:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 09:02:08,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:08,365 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:08,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:02:08,365 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:08,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash -633094042, now seen corresponding path program 1 times [2024-11-20 09:02:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:08,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219390742] [2024-11-20 09:02:08,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:08,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:08,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:08,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219390742] [2024-11-20 09:02:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219390742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:08,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:08,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:02:08,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858477501] [2024-11-20 09:02:08,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:08,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:02:08,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:08,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:02:08,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:08,792 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:09,077 INFO L93 Difference]: Finished difference Result 276 states and 376 transitions. [2024-11-20 09:02:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:02:09,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-20 09:02:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:09,079 INFO L225 Difference]: With dead ends: 276 [2024-11-20 09:02:09,079 INFO L226 Difference]: Without dead ends: 176 [2024-11-20 09:02:09,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:02:09,081 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 68 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:09,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 509 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:02:09,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-20 09:02:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2024-11-20 09:02:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 149 states have internal predecessors, (191), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 09:02:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 235 transitions. [2024-11-20 09:02:09,094 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 235 transitions. Word has length 113 [2024-11-20 09:02:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:09,094 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 235 transitions. [2024-11-20 09:02:09,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 235 transitions. [2024-11-20 09:02:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 09:02:09,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:09,097 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:09,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:02:09,098 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:09,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash -776494331, now seen corresponding path program 1 times [2024-11-20 09:02:09,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:09,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812670000] [2024-11-20 09:02:09,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:09,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:10,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:10,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812670000] [2024-11-20 09:02:10,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812670000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:10,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:10,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:02:10,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289898562] [2024-11-20 09:02:10,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:10,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:02:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:02:10,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:02:10,411 INFO L87 Difference]: Start difference. First operand 173 states and 235 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:02:10,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:10,921 INFO L93 Difference]: Finished difference Result 355 states and 479 transitions. [2024-11-20 09:02:10,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:02:10,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-20 09:02:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:10,925 INFO L225 Difference]: With dead ends: 355 [2024-11-20 09:02:10,926 INFO L226 Difference]: Without dead ends: 185 [2024-11-20 09:02:10,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:02:10,927 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 56 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:10,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 553 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:02:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-20 09:02:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2024-11-20 09:02:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.2727272727272727) internal successors, (196), 156 states have internal predecessors, (196), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 09:02:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 244 transitions. [2024-11-20 09:02:10,949 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 244 transitions. Word has length 114 [2024-11-20 09:02:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:10,949 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 244 transitions. [2024-11-20 09:02:10,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:02:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 244 transitions. [2024-11-20 09:02:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:02:10,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:10,953 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:10,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:02:10,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:10,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:10,954 INFO L85 PathProgramCache]: Analyzing trace with hash 200671924, now seen corresponding path program 1 times [2024-11-20 09:02:10,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:10,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441824014] [2024-11-20 09:02:10,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:12,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:12,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441824014] [2024-11-20 09:02:12,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441824014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:12,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:12,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 09:02:12,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291712641] [2024-11-20 09:02:12,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:12,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 09:02:12,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:12,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 09:02:12,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:02:12,887 INFO L87 Difference]: Start difference. First operand 182 states and 244 transitions. Second operand has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:02:13,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:13,640 INFO L93 Difference]: Finished difference Result 429 states and 571 transitions. [2024-11-20 09:02:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 09:02:13,641 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-11-20 09:02:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:13,643 INFO L225 Difference]: With dead ends: 429 [2024-11-20 09:02:13,643 INFO L226 Difference]: Without dead ends: 255 [2024-11-20 09:02:13,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:02:13,644 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 52 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:13,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 801 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 09:02:13,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-20 09:02:13,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 178. [2024-11-20 09:02:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 152 states have internal predecessors, (190), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 09:02:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 238 transitions. [2024-11-20 09:02:13,660 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 238 transitions. Word has length 115 [2024-11-20 09:02:13,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:13,661 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 238 transitions. [2024-11-20 09:02:13,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:02:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 238 transitions. [2024-11-20 09:02:13,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:02:13,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:13,664 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:13,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:02:13,664 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:13,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:13,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1223887013, now seen corresponding path program 1 times [2024-11-20 09:02:13,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:13,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905168081] [2024-11-20 09:02:13,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:13,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:14,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:14,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905168081] [2024-11-20 09:02:14,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905168081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:14,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:14,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:02:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831281439] [2024-11-20 09:02:14,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:14,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:02:14,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:14,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:02:14,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:14,485 INFO L87 Difference]: Start difference. First operand 178 states and 238 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:02:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:14,750 INFO L93 Difference]: Finished difference Result 348 states and 459 transitions. [2024-11-20 09:02:14,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:02:14,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2024-11-20 09:02:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:14,752 INFO L225 Difference]: With dead ends: 348 [2024-11-20 09:02:14,752 INFO L226 Difference]: Without dead ends: 178 [2024-11-20 09:02:14,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-11-20 09:02:14,753 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 41 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:14,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 327 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:02:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-20 09:02:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-11-20 09:02:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 139 states have (on average 1.2517985611510791) internal successors, (174), 140 states have internal predecessors, (174), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 09:02:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 218 transitions. [2024-11-20 09:02:14,764 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 218 transitions. Word has length 115 [2024-11-20 09:02:14,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:14,764 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 218 transitions. [2024-11-20 09:02:14,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:02:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 218 transitions. [2024-11-20 09:02:14,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:02:14,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:14,766 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:14,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:02:14,766 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:14,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1644013042, now seen corresponding path program 1 times [2024-11-20 09:02:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:14,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370196293] [2024-11-20 09:02:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:15,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:15,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370196293] [2024-11-20 09:02:15,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370196293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:15,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:15,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:02:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57568124] [2024-11-20 09:02:15,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:15,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:02:15,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:02:15,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:15,505 INFO L87 Difference]: Start difference. First operand 166 states and 218 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:15,739 INFO L93 Difference]: Finished difference Result 204 states and 265 transitions. [2024-11-20 09:02:15,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:02:15,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-20 09:02:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:15,742 INFO L225 Difference]: With dead ends: 204 [2024-11-20 09:02:15,743 INFO L226 Difference]: Without dead ends: 202 [2024-11-20 09:02:15,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:02:15,744 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 70 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:15,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 402 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:02:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-20 09:02:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2024-11-20 09:02:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.2160493827160495) internal successors, (197), 164 states have internal predecessors, (197), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 09:02:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 261 transitions. [2024-11-20 09:02:15,759 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 261 transitions. Word has length 115 [2024-11-20 09:02:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:15,759 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 261 transitions. [2024-11-20 09:02:15,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 261 transitions. [2024-11-20 09:02:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:02:15,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:15,761 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:15,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:02:15,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:15,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1645860084, now seen corresponding path program 1 times [2024-11-20 09:02:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:15,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029893713] [2024-11-20 09:02:15,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:15,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:16,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:16,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029893713] [2024-11-20 09:02:16,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029893713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:16,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:16,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:02:16,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361721485] [2024-11-20 09:02:16,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:16,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 09:02:16,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:16,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 09:02:16,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:02:16,493 INFO L87 Difference]: Start difference. First operand 201 states and 261 transitions. Second operand has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:02:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:17,018 INFO L93 Difference]: Finished difference Result 501 states and 642 transitions. [2024-11-20 09:02:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:02:17,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-11-20 09:02:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:17,021 INFO L225 Difference]: With dead ends: 501 [2024-11-20 09:02:17,022 INFO L226 Difference]: Without dead ends: 328 [2024-11-20 09:02:17,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:02:17,023 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 73 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:17,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 493 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:02:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-20 09:02:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 325. [2024-11-20 09:02:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 261 states have (on average 1.1877394636015326) internal successors, (310), 265 states have internal predecessors, (310), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 09:02:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 414 transitions. [2024-11-20 09:02:17,050 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 414 transitions. Word has length 115 [2024-11-20 09:02:17,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:17,051 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 414 transitions. [2024-11-20 09:02:17,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:02:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 414 transitions. [2024-11-20 09:02:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:02:17,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:17,053 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:17,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 09:02:17,053 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:17,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:17,054 INFO L85 PathProgramCache]: Analyzing trace with hash -874099850, now seen corresponding path program 1 times [2024-11-20 09:02:17,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:17,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731653104] [2024-11-20 09:02:17,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:17,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:17,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731653104] [2024-11-20 09:02:17,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731653104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:17,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:17,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:02:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360642595] [2024-11-20 09:02:17,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:17,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:02:17,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:17,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:02:17,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:02:17,393 INFO L87 Difference]: Start difference. First operand 325 states and 414 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:17,571 INFO L93 Difference]: Finished difference Result 634 states and 800 transitions. [2024-11-20 09:02:17,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:02:17,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-20 09:02:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:17,574 INFO L225 Difference]: With dead ends: 634 [2024-11-20 09:02:17,575 INFO L226 Difference]: Without dead ends: 337 [2024-11-20 09:02:17,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:02:17,576 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:17,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 194 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:02:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-20 09:02:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 245. [2024-11-20 09:02:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 198 states have (on average 1.1818181818181819) internal successors, (234), 200 states have internal predecessors, (234), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 09:02:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 306 transitions. [2024-11-20 09:02:17,602 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 306 transitions. Word has length 115 [2024-11-20 09:02:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:17,603 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 306 transitions. [2024-11-20 09:02:17,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 306 transitions. [2024-11-20 09:02:17,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:02:17,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:17,604 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:17,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 09:02:17,605 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:17,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash -194041480, now seen corresponding path program 1 times [2024-11-20 09:02:17,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:17,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609547539] [2024-11-20 09:02:17,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:17,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:17,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:17,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609547539] [2024-11-20 09:02:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609547539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:17,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:17,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:02:17,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020706110] [2024-11-20 09:02:17,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:17,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:02:17,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:17,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:02:17,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:17,902 INFO L87 Difference]: Start difference. First operand 245 states and 306 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:18,167 INFO L93 Difference]: Finished difference Result 604 states and 746 transitions. [2024-11-20 09:02:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:02:18,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-20 09:02:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:18,171 INFO L225 Difference]: With dead ends: 604 [2024-11-20 09:02:18,173 INFO L226 Difference]: Without dead ends: 391 [2024-11-20 09:02:18,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:02:18,175 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 57 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:18,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 484 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:02:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-20 09:02:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 387. [2024-11-20 09:02:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 324 states have (on average 1.1697530864197532) internal successors, (379), 328 states have internal predecessors, (379), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 09:02:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 475 transitions. [2024-11-20 09:02:18,212 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 475 transitions. Word has length 115 [2024-11-20 09:02:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:18,213 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 475 transitions. [2024-11-20 09:02:18,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 475 transitions. [2024-11-20 09:02:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 09:02:18,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:18,215 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:18,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 09:02:18,215 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:18,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1310951966, now seen corresponding path program 1 times [2024-11-20 09:02:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:18,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825301936] [2024-11-20 09:02:18,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:18,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-20 09:02:18,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:18,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825301936] [2024-11-20 09:02:18,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825301936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:02:18,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691856037] [2024-11-20 09:02:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:18,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:18,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:02:18,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:02:18,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 09:02:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:18,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 09:02:18,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:18,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 09:02:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-20 09:02:18,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:02:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-20 09:02:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691856037] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:02:19,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:02:19,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-20 09:02:19,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667192020] [2024-11-20 09:02:19,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:02:19,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 09:02:19,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:19,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 09:02:19,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:02:19,067 INFO L87 Difference]: Start difference. First operand 387 states and 475 transitions. Second operand has 11 states, 8 states have (on average 7.5) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 2 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-20 09:02:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:19,711 INFO L93 Difference]: Finished difference Result 589 states and 722 transitions. [2024-11-20 09:02:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 09:02:19,712 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 7.5) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 2 states have call predecessors, (17), 5 states have call successors, (17) Word has length 116 [2024-11-20 09:02:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:19,714 INFO L225 Difference]: With dead ends: 589 [2024-11-20 09:02:19,714 INFO L226 Difference]: Without dead ends: 234 [2024-11-20 09:02:19,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 251 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:02:19,715 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 199 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:19,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 250 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:02:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-20 09:02:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 227. [2024-11-20 09:02:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 185 states have (on average 1.162162162162162) internal successors, (215), 187 states have internal predecessors, (215), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 09:02:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 279 transitions. [2024-11-20 09:02:19,742 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 279 transitions. Word has length 116 [2024-11-20 09:02:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:19,742 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 279 transitions. [2024-11-20 09:02:19,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 7.5) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 2 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-20 09:02:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 279 transitions. [2024-11-20 09:02:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 09:02:19,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:19,744 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:19,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 09:02:19,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-20 09:02:19,946 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:19,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash -719202291, now seen corresponding path program 1 times [2024-11-20 09:02:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:19,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501482138] [2024-11-20 09:02:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:20,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:20,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501482138] [2024-11-20 09:02:20,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501482138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:20,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:20,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:02:20,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883494829] [2024-11-20 09:02:20,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:20,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:02:20,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:20,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:02:20,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:02:20,459 INFO L87 Difference]: Start difference. First operand 227 states and 279 transitions. Second operand has 7 states, 5 states have (on average 10.0) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:02:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:20,823 INFO L93 Difference]: Finished difference Result 418 states and 512 transitions. [2024-11-20 09:02:20,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:02:20,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.0) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2024-11-20 09:02:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:20,825 INFO L225 Difference]: With dead ends: 418 [2024-11-20 09:02:20,825 INFO L226 Difference]: Without dead ends: 227 [2024-11-20 09:02:20,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:02:20,826 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 94 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:20,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 153 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:02:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-20 09:02:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-20 09:02:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 185 states have (on average 1.1405405405405404) internal successors, (211), 187 states have internal predecessors, (211), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 09:02:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2024-11-20 09:02:20,847 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 117 [2024-11-20 09:02:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:20,847 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2024-11-20 09:02:20,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.0) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:02:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2024-11-20 09:02:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 09:02:20,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:20,849 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:20,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 09:02:20,849 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:20,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:20,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1127232922, now seen corresponding path program 1 times [2024-11-20 09:02:20,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:20,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927260126] [2024-11-20 09:02:20,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:20,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:21,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:21,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927260126] [2024-11-20 09:02:21,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927260126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:21,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:21,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:02:21,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830776939] [2024-11-20 09:02:21,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:21,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:02:21,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:02:21,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:02:21,661 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:02:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:22,243 INFO L93 Difference]: Finished difference Result 423 states and 508 transitions. [2024-11-20 09:02:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:02:22,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-20 09:02:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:22,245 INFO L225 Difference]: With dead ends: 423 [2024-11-20 09:02:22,245 INFO L226 Difference]: Without dead ends: 232 [2024-11-20 09:02:22,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:02:22,246 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 116 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:22,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 367 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:02:22,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-20 09:02:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2024-11-20 09:02:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 188 states have (on average 1.127659574468085) internal successors, (212), 190 states have internal predecessors, (212), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 09:02:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 276 transitions. [2024-11-20 09:02:22,280 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 276 transitions. Word has length 119 [2024-11-20 09:02:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:22,281 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 276 transitions. [2024-11-20 09:02:22,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:02:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 276 transitions. [2024-11-20 09:02:22,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 09:02:22,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:22,282 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:22,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 09:02:22,283 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:22,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:22,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1919891586, now seen corresponding path program 1 times [2024-11-20 09:02:22,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:22,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139343815] [2024-11-20 09:02:22,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:22,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 09:02:22,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438514096] [2024-11-20 09:02:22,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:22,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:22,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:02:22,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:02:22,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 09:02:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:22,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-20 09:02:22,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:22,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2024-11-20 09:02:22,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2024-11-20 09:02:22,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:02:22,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:02:22,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:02:22,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:02:23,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:02:23,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:02:23,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 1 [2024-11-20 09:02:23,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:02:23,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2024-11-20 09:02:23,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:23,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 59 [2024-11-20 09:02:23,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:23,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 68 treesize of output 28 [2024-11-20 09:02:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:23,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:02:23,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:23,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139343815] [2024-11-20 09:02:23,463 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 09:02:23,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438514096] [2024-11-20 09:02:23,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438514096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:23,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:23,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:02:23,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190623898] [2024-11-20 09:02:23,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:23,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 09:02:23,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:23,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 09:02:23,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:02:23,465 INFO L87 Difference]: Start difference. First operand 231 states and 276 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:24,145 INFO L93 Difference]: Finished difference Result 646 states and 758 transitions. [2024-11-20 09:02:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 09:02:24,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-11-20 09:02:24,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:24,148 INFO L225 Difference]: With dead ends: 646 [2024-11-20 09:02:24,149 INFO L226 Difference]: Without dead ends: 451 [2024-11-20 09:02:24,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:02:24,151 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 140 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:24,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 338 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 09:02:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-20 09:02:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 275. [2024-11-20 09:02:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 228 states have (on average 1.118421052631579) internal successors, (255), 229 states have internal predecessors, (255), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 09:02:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 323 transitions. [2024-11-20 09:02:24,184 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 323 transitions. Word has length 120 [2024-11-20 09:02:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:24,185 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 323 transitions. [2024-11-20 09:02:24,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 323 transitions. [2024-11-20 09:02:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 09:02:24,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:24,187 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:24,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 09:02:24,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-20 09:02:24,388 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:24,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:24,388 INFO L85 PathProgramCache]: Analyzing trace with hash 293814618, now seen corresponding path program 1 times [2024-11-20 09:02:24,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:24,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669779102] [2024-11-20 09:02:24,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:24,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:24,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:24,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669779102] [2024-11-20 09:02:24,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669779102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:24,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:24,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:02:24,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141584649] [2024-11-20 09:02:24,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:24,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:02:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:24,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:02:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:02:24,654 INFO L87 Difference]: Start difference. First operand 275 states and 323 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:25,025 INFO L93 Difference]: Finished difference Result 650 states and 768 transitions. [2024-11-20 09:02:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:02:25,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-11-20 09:02:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:25,028 INFO L225 Difference]: With dead ends: 650 [2024-11-20 09:02:25,028 INFO L226 Difference]: Without dead ends: 455 [2024-11-20 09:02:25,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:02:25,029 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 89 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:25,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 774 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:02:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-20 09:02:25,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 296. [2024-11-20 09:02:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 249 states have (on average 1.1244979919678715) internal successors, (280), 250 states have internal predecessors, (280), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 09:02:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 348 transitions. [2024-11-20 09:02:25,056 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 348 transitions. Word has length 120 [2024-11-20 09:02:25,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:25,056 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 348 transitions. [2024-11-20 09:02:25,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 348 transitions. [2024-11-20 09:02:25,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 09:02:25,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:25,057 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:25,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 09:02:25,058 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:25,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:25,058 INFO L85 PathProgramCache]: Analyzing trace with hash 710658479, now seen corresponding path program 1 times [2024-11-20 09:02:25,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:25,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265604028] [2024-11-20 09:02:25,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:25,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 09:02:25,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235676006] [2024-11-20 09:02:25,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:25,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:25,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:02:25,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:02:25,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 09:02:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-20 09:02:25,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:25,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2024-11-20 09:02:25,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2024-11-20 09:02:25,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:25,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:25,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:25,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:25,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:25,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:25,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 1 [2024-11-20 09:02:25,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:02:25,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-20 09:02:25,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:25,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2024-11-20 09:02:26,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:26,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 23 [2024-11-20 09:02:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:26,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:02:26,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:26,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265604028] [2024-11-20 09:02:26,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 09:02:26,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235676006] [2024-11-20 09:02:26,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235676006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:26,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:26,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:02:26,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927176802] [2024-11-20 09:02:26,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:26,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 09:02:26,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 09:02:26,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:02:26,259 INFO L87 Difference]: Start difference. First operand 296 states and 348 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:28,171 INFO L93 Difference]: Finished difference Result 699 states and 820 transitions. [2024-11-20 09:02:28,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:02:28,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-20 09:02:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:28,173 INFO L225 Difference]: With dead ends: 699 [2024-11-20 09:02:28,174 INFO L226 Difference]: Without dead ends: 483 [2024-11-20 09:02:28,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:02:28,175 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 135 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:28,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 387 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 09:02:28,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-20 09:02:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 307. [2024-11-20 09:02:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 260 states have (on average 1.1192307692307693) internal successors, (291), 261 states have internal predecessors, (291), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 09:02:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 359 transitions. [2024-11-20 09:02:28,202 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 359 transitions. Word has length 121 [2024-11-20 09:02:28,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:28,202 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 359 transitions. [2024-11-20 09:02:28,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 359 transitions. [2024-11-20 09:02:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 09:02:28,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:28,204 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:28,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 09:02:28,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:28,408 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:28,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2088738115, now seen corresponding path program 1 times [2024-11-20 09:02:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:28,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932465213] [2024-11-20 09:02:28,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:28,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:29,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:29,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932465213] [2024-11-20 09:02:29,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932465213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:29,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:29,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 09:02:29,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993691909] [2024-11-20 09:02:29,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:29,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 09:02:29,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:29,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 09:02:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:02:29,379 INFO L87 Difference]: Start difference. First operand 307 states and 359 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:29,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:29,909 INFO L93 Difference]: Finished difference Result 538 states and 630 transitions. [2024-11-20 09:02:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:02:29,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2024-11-20 09:02:29,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:29,912 INFO L225 Difference]: With dead ends: 538 [2024-11-20 09:02:29,912 INFO L226 Difference]: Without dead ends: 322 [2024-11-20 09:02:29,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:02:29,913 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:29,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 837 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:02:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-20 09:02:29,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2024-11-20 09:02:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 269 states have (on average 1.1152416356877324) internal successors, (300), 270 states have internal predecessors, (300), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 09:02:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 372 transitions. [2024-11-20 09:02:29,940 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 372 transitions. Word has length 122 [2024-11-20 09:02:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:29,941 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 372 transitions. [2024-11-20 09:02:29,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 372 transitions. [2024-11-20 09:02:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 09:02:29,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:29,942 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:29,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 09:02:29,943 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:29,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:29,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1501932101, now seen corresponding path program 1 times [2024-11-20 09:02:29,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:29,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965249499] [2024-11-20 09:02:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:29,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 09:02:30,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528004260] [2024-11-20 09:02:30,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:30,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:30,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:02:30,019 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:02:30,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 09:02:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:30,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-20 09:02:30,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:30,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:30,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:30,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-20 09:02:30,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:30,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-20 09:02:30,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:30,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2024-11-20 09:02:30,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:30,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 65 [2024-11-20 09:02:33,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:33,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 134 treesize of output 38 [2024-11-20 09:02:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:33,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:02:33,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965249499] [2024-11-20 09:02:33,881 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 09:02:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528004260] [2024-11-20 09:02:33,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528004260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:33,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:33,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:02:33,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444147358] [2024-11-20 09:02:33,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:33,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:02:33,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:33,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:02:33,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:02:33,884 INFO L87 Difference]: Start difference. First operand 319 states and 372 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:36,570 INFO L93 Difference]: Finished difference Result 661 states and 771 transitions. [2024-11-20 09:02:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:02:36,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2024-11-20 09:02:36,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:36,573 INFO L225 Difference]: With dead ends: 661 [2024-11-20 09:02:36,573 INFO L226 Difference]: Without dead ends: 433 [2024-11-20 09:02:36,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:02:36,574 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 178 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:36,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 481 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 09:02:36,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-20 09:02:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 324. [2024-11-20 09:02:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 274 states have (on average 1.1167883211678833) internal successors, (306), 275 states have internal predecessors, (306), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 09:02:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 378 transitions. [2024-11-20 09:02:36,605 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 378 transitions. Word has length 122 [2024-11-20 09:02:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:36,605 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 378 transitions. [2024-11-20 09:02:36,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 378 transitions. [2024-11-20 09:02:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 09:02:36,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:36,607 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:36,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 09:02:36,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:36,808 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:36,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2065680571, now seen corresponding path program 1 times [2024-11-20 09:02:36,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:36,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140651478] [2024-11-20 09:02:36,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:36,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 09:02:36,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987474104] [2024-11-20 09:02:36,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:36,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:36,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:02:36,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:02:36,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 09:02:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:37,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 09:02:37,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:37,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:37,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:37,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:37,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-20 09:02:37,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:37,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-20 09:02:37,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:37,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2024-11-20 09:02:37,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:37,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 74 [2024-11-20 09:02:37,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:37,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 32 [2024-11-20 09:02:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:37,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:02:37,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:37,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140651478] [2024-11-20 09:02:37,414 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 09:02:37,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987474104] [2024-11-20 09:02:37,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987474104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:37,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:37,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:02:37,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841679006] [2024-11-20 09:02:37,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:37,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:02:37,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:37,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:02:37,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:02:37,416 INFO L87 Difference]: Start difference. First operand 324 states and 378 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:37,973 INFO L93 Difference]: Finished difference Result 721 states and 839 transitions. [2024-11-20 09:02:37,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:02:37,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2024-11-20 09:02:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:37,977 INFO L225 Difference]: With dead ends: 721 [2024-11-20 09:02:37,977 INFO L226 Difference]: Without dead ends: 488 [2024-11-20 09:02:37,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:02:37,978 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 218 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:37,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 355 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:02:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-20 09:02:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 336. [2024-11-20 09:02:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 286 states have (on average 1.1153846153846154) internal successors, (319), 287 states have internal predecessors, (319), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 09:02:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 391 transitions. [2024-11-20 09:02:38,012 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 391 transitions. Word has length 122 [2024-11-20 09:02:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:38,013 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 391 transitions. [2024-11-20 09:02:38,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 391 transitions. [2024-11-20 09:02:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 09:02:38,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:38,014 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:38,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 09:02:38,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-20 09:02:38,215 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:38,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:38,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1642480711, now seen corresponding path program 1 times [2024-11-20 09:02:38,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:38,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147111915] [2024-11-20 09:02:38,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:38,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:02:38,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:38,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147111915] [2024-11-20 09:02:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147111915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:38,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:38,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:02:38,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404162422] [2024-11-20 09:02:38,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:38,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:02:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:38,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:02:38,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:02:38,497 INFO L87 Difference]: Start difference. First operand 336 states and 391 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:38,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:38,742 INFO L93 Difference]: Finished difference Result 587 states and 684 transitions. [2024-11-20 09:02:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:02:38,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2024-11-20 09:02:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:38,745 INFO L225 Difference]: With dead ends: 587 [2024-11-20 09:02:38,746 INFO L226 Difference]: Without dead ends: 342 [2024-11-20 09:02:38,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:02:38,747 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 54 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:38,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 588 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:02:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-20 09:02:38,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 337. [2024-11-20 09:02:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 287 states have (on average 1.1149825783972125) internal successors, (320), 288 states have internal predecessors, (320), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 09:02:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 392 transitions. [2024-11-20 09:02:38,778 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 392 transitions. Word has length 122 [2024-11-20 09:02:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:38,778 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 392 transitions. [2024-11-20 09:02:38,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 392 transitions. [2024-11-20 09:02:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:02:38,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:38,780 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:38,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 09:02:38,780 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:38,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1448611834, now seen corresponding path program 1 times [2024-11-20 09:02:38,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:38,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116743348] [2024-11-20 09:02:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:38,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-20 09:02:39,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:39,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116743348] [2024-11-20 09:02:39,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116743348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:02:39,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509726994] [2024-11-20 09:02:39,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:39,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:39,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:02:39,505 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:02:39,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 09:02:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:39,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-20 09:02:39,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:39,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-20 09:02:39,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-20 09:02:39,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-20 09:02:40,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-20 09:02:40,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-20 09:02:40,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2024-11-20 09:02:40,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-20 09:02:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-20 09:02:40,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:02:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-20 09:02:40,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509726994] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:02:40,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:02:40,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2024-11-20 09:02:40,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702637677] [2024-11-20 09:02:40,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:02:40,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-20 09:02:40,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:40,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-20 09:02:40,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-20 09:02:40,387 INFO L87 Difference]: Start difference. First operand 337 states and 392 transitions. Second operand has 20 states, 17 states have (on average 7.411764705882353) internal successors, (126), 20 states have internal predecessors, (126), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 5 states have call predecessors, (39), 8 states have call successors, (39) [2024-11-20 09:02:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:41,142 INFO L93 Difference]: Finished difference Result 538 states and 611 transitions. [2024-11-20 09:02:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 09:02:41,142 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.411764705882353) internal successors, (126), 20 states have internal predecessors, (126), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 5 states have call predecessors, (39), 8 states have call successors, (39) Word has length 123 [2024-11-20 09:02:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:41,144 INFO L225 Difference]: With dead ends: 538 [2024-11-20 09:02:41,144 INFO L226 Difference]: Without dead ends: 292 [2024-11-20 09:02:41,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2024-11-20 09:02:41,145 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 137 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:41,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 273 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:02:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-20 09:02:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 286. [2024-11-20 09:02:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 231 states have (on average 1.051948051948052) internal successors, (243), 232 states have internal predecessors, (243), 36 states have call successors, (36), 18 states have call predecessors, (36), 18 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 09:02:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2024-11-20 09:02:41,184 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 123 [2024-11-20 09:02:41,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:41,184 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2024-11-20 09:02:41,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.411764705882353) internal successors, (126), 20 states have internal predecessors, (126), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 5 states have call predecessors, (39), 8 states have call successors, (39) [2024-11-20 09:02:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2024-11-20 09:02:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-20 09:02:41,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:41,187 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:41,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 09:02:41,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:41,388 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:41,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash 29267610, now seen corresponding path program 1 times [2024-11-20 09:02:41,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:41,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055607317] [2024-11-20 09:02:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 09:02:41,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551070564] [2024-11-20 09:02:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:41,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:41,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:02:41,586 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:02:41,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 09:02:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:42,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-20 09:02:42,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:42,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:42,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:42,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:42,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:42,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 1 [2024-11-20 09:02:42,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:02:42,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-20 09:02:42,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:42,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2024-11-20 09:02:42,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:42,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 10 [2024-11-20 09:02:42,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:42,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:42,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:42,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:42,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:42,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:42,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 1 [2024-11-20 09:02:42,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:02:42,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-20 09:02:42,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:42,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 69 [2024-11-20 09:02:42,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:42,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 24 [2024-11-20 09:02:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2024-11-20 09:02:42,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:02:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2024-11-20 09:02:42,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:42,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055607317] [2024-11-20 09:02:42,953 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 09:02:42,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551070564] [2024-11-20 09:02:42,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551070564] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 09:02:42,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 09:02:42,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2024-11-20 09:02:42,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189526404] [2024-11-20 09:02:42,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:42,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:02:42,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:42,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:02:42,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:02:42,955 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:43,380 INFO L93 Difference]: Finished difference Result 476 states and 522 transitions. [2024-11-20 09:02:43,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:02:43,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 236 [2024-11-20 09:02:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:43,382 INFO L225 Difference]: With dead ends: 476 [2024-11-20 09:02:43,382 INFO L226 Difference]: Without dead ends: 289 [2024-11-20 09:02:43,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:02:43,383 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 16 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:43,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 289 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:02:43,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-20 09:02:43,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 253. [2024-11-20 09:02:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 198 states have (on average 1.0353535353535352) internal successors, (205), 199 states have internal predecessors, (205), 36 states have call successors, (36), 18 states have call predecessors, (36), 18 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 09:02:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 277 transitions. [2024-11-20 09:02:43,417 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 277 transitions. Word has length 236 [2024-11-20 09:02:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:43,421 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 277 transitions. [2024-11-20 09:02:43,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:43,422 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 277 transitions. [2024-11-20 09:02:43,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-20 09:02:43,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:43,423 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:43,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-20 09:02:43,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:43,624 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:43,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1005051411, now seen corresponding path program 1 times [2024-11-20 09:02:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:43,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072415258] [2024-11-20 09:02:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 09:02:43,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044358268] [2024-11-20 09:02:43,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:43,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:43,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:02:43,774 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:02:43,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 09:02:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:44,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-20 09:02:44,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:44,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:44,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:44,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:44,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:44,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 1 [2024-11-20 09:02:44,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:02:44,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-20 09:02:44,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:44,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2024-11-20 09:02:44,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:44,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 10 [2024-11-20 09:02:44,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:44,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:44,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:44,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:44,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:44,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 09:02:44,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 1 [2024-11-20 09:02:44,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:02:44,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-20 09:02:44,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:44,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 51 [2024-11-20 09:02:44,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:02:44,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 21 [2024-11-20 09:02:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2024-11-20 09:02:44,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:02:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2024-11-20 09:02:44,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072415258] [2024-11-20 09:02:44,990 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 09:02:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044358268] [2024-11-20 09:02:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044358268] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 09:02:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 09:02:44,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-20 09:02:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339007602] [2024-11-20 09:02:44,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:44,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:02:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:44,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:02:44,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:02:44,992 INFO L87 Difference]: Start difference. First operand 253 states and 277 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:45,482 INFO L93 Difference]: Finished difference Result 428 states and 465 transitions. [2024-11-20 09:02:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:02:45,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 237 [2024-11-20 09:02:45,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:45,484 INFO L225 Difference]: With dead ends: 428 [2024-11-20 09:02:45,484 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 09:02:45,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 464 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:02:45,486 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 30 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 189 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.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:45,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 189 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:02:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 09:02:45,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 09:02:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:02:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 09:02:45,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 237 [2024-11-20 09:02:45,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:45,487 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 09:02:45,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:02:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 09:02:45,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 09:02:45,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 09:02:45,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-20 09:02:45,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-20 09:02:45,694 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:02:45,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 09:02:57,103 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:02:57,113 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:102) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:105) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:57) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-20 09:02:57,118 INFO L158 Benchmark]: Toolchain (without parser) took 53264.82ms. Allocated memory was 180.4MB in the beginning and 866.1MB in the end (delta: 685.8MB). Free memory was 125.5MB in the beginning and 572.5MB in the end (delta: -446.9MB). Peak memory consumption was 506.6MB. Max. memory is 16.1GB. [2024-11-20 09:02:57,118 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:02:57,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.89ms. Allocated memory is still 180.4MB. Free memory was 125.1MB in the beginning and 107.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 09:02:57,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.58ms. Allocated memory is still 180.4MB. Free memory was 107.1MB in the beginning and 103.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:02:57,119 INFO L158 Benchmark]: Boogie Preprocessor took 88.10ms. Allocated memory is still 180.4MB. Free memory was 103.5MB in the beginning and 99.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:02:57,119 INFO L158 Benchmark]: RCFGBuilder took 659.05ms. Allocated memory is still 180.4MB. Free memory was 99.6MB in the beginning and 71.0MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-20 09:02:57,119 INFO L158 Benchmark]: TraceAbstraction took 52077.11ms. Allocated memory was 180.4MB in the beginning and 866.1MB in the end (delta: 685.8MB). Free memory was 70.6MB in the beginning and 572.5MB in the end (delta: -501.9MB). Peak memory consumption was 452.1MB. Max. memory is 16.1GB. [2024-11-20 09:02:57,120 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.89ms. Allocated memory is still 180.4MB. Free memory was 125.1MB in the beginning and 107.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.58ms. Allocated memory is still 180.4MB. Free memory was 107.1MB in the beginning and 103.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.10ms. Allocated memory is still 180.4MB. Free memory was 103.5MB in the beginning and 99.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 659.05ms. Allocated memory is still 180.4MB. Free memory was 99.6MB in the beginning and 71.0MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 52077.11ms. Allocated memory was 180.4MB in the beginning and 866.1MB in the end (delta: 685.8MB). Free memory was 70.6MB in the beginning and 572.5MB in the end (delta: -501.9MB). Peak memory consumption was 452.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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.6s, OverallIterations: 27, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2122 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2101 mSDsluCounter, 10786 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8040 mSDsCounter, 439 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7836 IncrementalHoareTripleChecker+Invalid, 8275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 439 mSolverCounterUnsat, 2746 mSDtfsCounter, 7836 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2767 GetRequests, 2551 SyntacticMatches, 5 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=387occurred in iteration=14, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 1097 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 4585 NumberOfCodeBlocks, 4585 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4306 ConstructedInterpolants, 0 QuantifiedInterpolants, 17971 SizeOfPredicates, 36 NumberOfNonLiveVariables, 3612 ConjunctsInSsa, 294 ConjunctsInUnsatCore, 33 InterpolantComputations, 25 PerfectInterpolantSequences, 16734/16840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-20 09:02:57,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:02:59,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:02:59,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 09:02:59,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:02:59,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:02:59,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:02:59,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:02:59,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:02:59,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:02:59,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:02:59,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:02:59,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:02:59,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:02:59,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:02:59,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:02:59,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:02:59,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:02:59,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:02:59,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:02:59,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:02:59,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:02:59,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:02:59,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:02:59,575 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 09:02:59,575 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 09:02:59,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:02:59,576 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 09:02:59,576 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:02:59,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:02:59,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:02:59,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:02:59,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:02:59,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:02:59,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:02:59,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:02:59,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:02:59,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:02:59,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:02:59,580 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 09:02:59,581 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 09:02:59,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:02:59,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:02:59,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:02:59,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:02:59,583 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 [2024-11-20 09:02:59,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:02:59,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:02:59,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:02:59,949 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:02:59,950 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:02:59,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i [2024-11-20 09:03:01,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:03:01,782 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:03:01,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i [2024-11-20 09:03:01,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a036f0133/5d612d0e576c42cc81232c166a8641fd/FLAG7c1502323 [2024-11-20 09:03:01,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a036f0133/5d612d0e576c42cc81232c166a8641fd [2024-11-20 09:03:01,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:03:01,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:03:01,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:03:01,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:03:01,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:03:01,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:03:01" (1/1) ... [2024-11-20 09:03:01,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b74194a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:01, skipping insertion in model container [2024-11-20 09:03:01,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:03:01" (1/1) ... [2024-11-20 09:03:01,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:03:02,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i[916,929] [2024-11-20 09:03:02,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:03:02,144 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:03:02,157 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i[916,929] [2024-11-20 09:03:02,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:03:02,261 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:03:02,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02 WrapperNode [2024-11-20 09:03:02,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:03:02,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:03:02,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:03:02,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:03:02,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (1/1) ... [2024-11-20 09:03:02,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (1/1) ... [2024-11-20 09:03:02,338 INFO L138 Inliner]: procedures = 31, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 404 [2024-11-20 09:03:02,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:03:02,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:03:02,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:03:02,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:03:02,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (1/1) ... [2024-11-20 09:03:02,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (1/1) ... [2024-11-20 09:03:02,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (1/1) ... [2024-11-20 09:03:02,378 INFO L175 MemorySlicer]: Split 120 memory accesses to 2 slices as follows [2, 118]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-20 09:03:02,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (1/1) ... [2024-11-20 09:03:02,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (1/1) ... [2024-11-20 09:03:02,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (1/1) ... [2024-11-20 09:03:02,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (1/1) ... [2024-11-20 09:03:02,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (1/1) ... [2024-11-20 09:03:02,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (1/1) ... [2024-11-20 09:03:02,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:03:02,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:03:02,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:03:02,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:03:02,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (1/1) ... [2024-11-20 09:03:02,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:03:02,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:03:02,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 09:03:02,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 09:03:02,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:03:02,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 09:03:02,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 09:03:02,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 09:03:02,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 09:03:02,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 09:03:02,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 09:03:02,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-20 09:03:02,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-20 09:03:02,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-20 09:03:02,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-20 09:03:02,530 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:03:02,532 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:03:02,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:03:02,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:03:02,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 09:03:02,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 09:03:02,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 09:03:02,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 09:03:02,650 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:03:02,653 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:03:03,315 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-20 09:03:03,316 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:03:03,333 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:03:03,334 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:03:03,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:03:03 BoogieIcfgContainer [2024-11-20 09:03:03,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:03:03,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:03:03,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:03:03,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:03:03,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:03:01" (1/3) ... [2024-11-20 09:03:03,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1d352f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:03:03, skipping insertion in model container [2024-11-20 09:03:03,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:03:02" (2/3) ... [2024-11-20 09:03:03,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1d352f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:03:03, skipping insertion in model container [2024-11-20 09:03:03,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:03:03" (3/3) ... [2024-11-20 09:03:03,345 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-87.i [2024-11-20 09:03:03,362 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:03:03,362 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:03:03,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:03:03,462 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;@5eb2e9d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:03:03,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:03:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 71 states have internal predecessors, (96), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:03:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 09:03:03,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:03:03,481 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:03:03,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:03:03,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:03:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash 464292550, now seen corresponding path program 1 times [2024-11-20 09:03:03,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:03:03,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248815527] [2024-11-20 09:03:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:03:03,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:03,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:03:03,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 09:03:03,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 09:03:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:03:03,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 09:03:03,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:03:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-20 09:03:03,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:03:03,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:03:03,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248815527] [2024-11-20 09:03:03,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248815527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:03:03,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:03:03,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:03:03,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660462787] [2024-11-20 09:03:03,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:03:03,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:03:03,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:03:03,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:03:03,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:03:03,845 INFO L87 Difference]: Start difference. First operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 71 states have internal predecessors, (96), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:03:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:03:03,883 INFO L93 Difference]: Finished difference Result 167 states and 256 transitions. [2024-11-20 09:03:03,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:03:03,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-11-20 09:03:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:03:03,893 INFO L225 Difference]: With dead ends: 167 [2024-11-20 09:03:03,893 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 09:03:03,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:03:03,902 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:03:03,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:03:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 09:03:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-20 09:03:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:03:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2024-11-20 09:03:03,959 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 111 [2024-11-20 09:03:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:03:03,961 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2024-11-20 09:03:03,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:03:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2024-11-20 09:03:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 09:03:03,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:03:03,969 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:03:03,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 09:03:04,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:04,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:03:04,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:03:04,172 INFO L85 PathProgramCache]: Analyzing trace with hash 450654890, now seen corresponding path program 1 times [2024-11-20 09:03:04,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:03:04,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917920827] [2024-11-20 09:03:04,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:03:04,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:04,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:03:04,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 09:03:04,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 09:03:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:03:04,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 09:03:04,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:03:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:03:04,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:03:04,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:03:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917920827] [2024-11-20 09:03:04,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917920827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:03:04,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:03:04,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:03:04,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614203114] [2024-11-20 09:03:04,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:03:04,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:03:04,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:03:04,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:03:04,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:03:04,449 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:03:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:03:04,491 INFO L93 Difference]: Finished difference Result 165 states and 230 transitions. [2024-11-20 09:03:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:03:04,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-11-20 09:03:04,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:03:04,494 INFO L225 Difference]: With dead ends: 165 [2024-11-20 09:03:04,494 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 09:03:04,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:03:04,496 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:03:04,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:03:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 09:03:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-20 09:03:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:03:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-11-20 09:03:04,516 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 111 [2024-11-20 09:03:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:03:04,519 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-11-20 09:03:04,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:03:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-11-20 09:03:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 09:03:04,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:03:04,526 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:03:04,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 09:03:04,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:04,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:03:04,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:03:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash -114037682, now seen corresponding path program 1 times [2024-11-20 09:03:04,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:03:04,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658929107] [2024-11-20 09:03:04,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:03:04,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:04,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:03:04,736 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 09:03:04,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 09:03:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:03:04,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 09:03:04,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:03:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:03:04,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:03:04,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:03:04,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658929107] [2024-11-20 09:03:04,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658929107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:03:04,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:03:04,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:03:04,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592487916] [2024-11-20 09:03:04,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:03:04,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:03:04,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:03:04,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:03:04,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:03:04,971 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:03:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:03:05,022 INFO L93 Difference]: Finished difference Result 170 states and 235 transitions. [2024-11-20 09:03:05,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:03:05,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-20 09:03:05,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:03:05,025 INFO L225 Difference]: With dead ends: 170 [2024-11-20 09:03:05,025 INFO L226 Difference]: Without dead ends: 88 [2024-11-20 09:03:05,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:03:05,027 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:03:05,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:03:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-20 09:03:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-20 09:03:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:03:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-11-20 09:03:05,037 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 113 [2024-11-20 09:03:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:03:05,038 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-11-20 09:03:05,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:03:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-11-20 09:03:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 09:03:05,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:03:05,040 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:03:05,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 09:03:05,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:05,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:03:05,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:03:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash 566020688, now seen corresponding path program 1 times [2024-11-20 09:03:05,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:03:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186412602] [2024-11-20 09:03:05,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:03:05,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:05,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:03:05,245 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 09:03:05,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 09:03:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:03:05,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 09:03:05,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:03:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:03:05,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:03:05,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:03:05,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186412602] [2024-11-20 09:03:05,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186412602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:03:05,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:03:05,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:03:05,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060143543] [2024-11-20 09:03:05,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:03:05,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:03:05,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:03:05,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:03:05,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:03:05,468 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:03:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:03:05,518 INFO L93 Difference]: Finished difference Result 174 states and 239 transitions. [2024-11-20 09:03:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:03:05,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-20 09:03:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:03:05,521 INFO L225 Difference]: With dead ends: 174 [2024-11-20 09:03:05,521 INFO L226 Difference]: Without dead ends: 90 [2024-11-20 09:03:05,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:03:05,523 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 425 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-11-20 09:03:05,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 425 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:03:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-20 09:03:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-20 09:03:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:03:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-11-20 09:03:05,541 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 113 [2024-11-20 09:03:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:03:05,542 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-11-20 09:03:05,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:03:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-11-20 09:03:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 09:03:05,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:03:05,547 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:03:05,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 09:03:05,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:05,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:03:05,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:03:05,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1953939246, now seen corresponding path program 1 times [2024-11-20 09:03:05,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:03:05,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505625172] [2024-11-20 09:03:05,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:03:05,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:05,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:03:05,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 09:03:05,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 09:03:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:03:05,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 09:03:05,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:03:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 09:03:05,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:03:05,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:03:05,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505625172] [2024-11-20 09:03:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505625172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:03:05,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:03:05,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:03:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179591447] [2024-11-20 09:03:05,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:03:05,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:03:05,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:03:05,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:03:05,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:03:05,961 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:03:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:03:06,096 INFO L93 Difference]: Finished difference Result 178 states and 243 transitions. [2024-11-20 09:03:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:03:06,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-20 09:03:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:03:06,100 INFO L225 Difference]: With dead ends: 178 [2024-11-20 09:03:06,100 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 09:03:06,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:03:06,102 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:03:06,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 525 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:03:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 09:03:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-20 09:03:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 09:03:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-11-20 09:03:06,119 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 113 [2024-11-20 09:03:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:03:06,122 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-11-20 09:03:06,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 09:03:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-11-20 09:03:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 09:03:06,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:03:06,124 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:03:06,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 09:03:06,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:06,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:03:06,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:03:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1952092204, now seen corresponding path program 1 times [2024-11-20 09:03:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:03:06,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739846724] [2024-11-20 09:03:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:03:06,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:06,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:03:06,330 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 09:03:06,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 09:03:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:03:06,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 09:03:06,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:03:06,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2024-11-20 09:03:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-20 09:03:06,827 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:03:06,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:03:06,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739846724] [2024-11-20 09:03:06,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739846724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:03:06,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:03:06,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 09:03:06,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536853338] [2024-11-20 09:03:06,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:03:06,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 09:03:06,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:03:06,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 09:03:06,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:03:06,831 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:03:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:03:08,204 INFO L93 Difference]: Finished difference Result 217 states and 291 transitions. [2024-11-20 09:03:08,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 09:03:08,204 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2024-11-20 09:03:08,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:03:08,206 INFO L225 Difference]: With dead ends: 217 [2024-11-20 09:03:08,206 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 09:03:08,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-20 09:03:08,208 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 80 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:03:08,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 400 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 09:03:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 09:03:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2024-11-20 09:03:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.202127659574468) internal successors, (113), 95 states have internal predecessors, (113), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 09:03:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2024-11-20 09:03:08,231 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 113 [2024-11-20 09:03:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:03:08,232 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2024-11-20 09:03:08,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:03:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2024-11-20 09:03:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:03:08,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:03:08,234 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:03:08,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 09:03:08,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:08,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:03:08,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:03:08,436 INFO L85 PathProgramCache]: Analyzing trace with hash 958874285, now seen corresponding path program 1 times [2024-11-20 09:03:08,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:03:08,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107079034] [2024-11-20 09:03:08,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:03:08,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:03:08,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:03:08,440 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 09:03:08,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 09:03:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:03:08,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 09:03:08,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:03:08,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:03:08,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 71 [2024-11-20 09:03:08,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:03:08,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 80 [2024-11-20 09:03:09,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:03:09,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 93 treesize of output 80 [2024-11-20 09:03:09,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:03:09,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 95 treesize of output 100 [2024-11-20 09:03:09,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:03:09,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 101 treesize of output 35 [2024-11-20 09:03:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-20 09:03:09,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:03:09,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:03:09,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107079034] [2024-11-20 09:03:09,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107079034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:03:09,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:03:09,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:03:09,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956153047] [2024-11-20 09:03:09,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:03:09,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:03:09,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:03:09,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:03:09,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:03:09,280 INFO L87 Difference]: Start difference. First operand 124 states and 165 transitions. Second operand has 13 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:03:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:03:11,692 INFO L93 Difference]: Finished difference Result 285 states and 371 transitions. [2024-11-20 09:03:11,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-20 09:03:11,693 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-11-20 09:03:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:03:11,694 INFO L225 Difference]: With dead ends: 285 [2024-11-20 09:03:11,695 INFO L226 Difference]: Without dead ends: 189 [2024-11-20 09:03:11,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2024-11-20 09:03:11,696 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 290 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 09:03:11,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 356 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 09:03:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-20 09:03:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 179. [2024-11-20 09:03:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 141 states have (on average 1.2127659574468086) internal successors, (171), 143 states have internal predecessors, (171), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 09:03:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 235 transitions. [2024-11-20 09:03:11,733 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 235 transitions. Word has length 115 [2024-11-20 09:03:11,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:03:11,735 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 235 transitions. [2024-11-20 09:03:11,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 09:03:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 235 transitions. [2024-11-20 09:03:11,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:03:11,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:03:11,737 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:03:11,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0