./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.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 b8b9ffa0f086760a52bbb5b7ce872ecb50536a94abf6bed664eac71cc82e5722 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:41:41,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:41:41,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:41:41,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:41:41,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:41:41,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:41:41,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:41:41,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:41:41,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:41:41,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:41:41,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:41:41,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:41:41,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:41:41,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:41:41,544 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:41:41,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:41:41,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:41:41,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:41:41,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:41:41,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:41:41,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:41:41,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:41:41,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:41:41,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:41:41,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:41:41,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:41:41,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:41:41,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:41:41,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:41:41,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:41:41,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:41:41,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:41:41,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:41:41,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:41:41,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:41:41,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:41:41,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:41:41,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:41:41,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:41:41,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:41:41,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:41:41,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:41:41,554 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 -> b8b9ffa0f086760a52bbb5b7ce872ecb50536a94abf6bed664eac71cc82e5722 [2024-11-08 20:41:41,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:41:41,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:41:41,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:41:41,843 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:41:41,843 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:41:41,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2024-11-08 20:41:43,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:41:43,530 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:41:43,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2024-11-08 20:41:43,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd250722e/80a4f8fddfb149869d9aebd42897480c/FLAG4697f32e9 [2024-11-08 20:41:43,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd250722e/80a4f8fddfb149869d9aebd42897480c [2024-11-08 20:41:43,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:41:43,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:41:43,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:41:43,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:41:43,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:41:43,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:43,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180a01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43, skipping insertion in model container [2024-11-08 20:41:43,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:43,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:41:43,778 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_fillercode_fillercodesize_ps-cn-25_file-59.i[915,928] [2024-11-08 20:41:43,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:41:43,861 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:41:43,871 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_fillercode_fillercodesize_ps-cn-25_file-59.i[915,928] [2024-11-08 20:41:43,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:41:43,944 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:41:43,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43 WrapperNode [2024-11-08 20:41:43,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:41:43,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:41:43,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:41:43,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:41:43,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:43,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:44,065 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-11-08 20:41:44,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:41:44,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:41:44,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:41:44,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:41:44,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:44,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:44,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:44,117 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:41:44,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:44,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:44,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:44,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:44,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:44,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:44,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:41:44,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:41:44,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:41:44,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:41:44,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (1/1) ... [2024-11-08 20:41:44,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:41:44,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:41:44,204 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-08 20:41:44,209 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-08 20:41:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:41:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:41:44,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:41:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:41:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:41:44,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:41:44,362 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:41:44,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:41:44,904 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 20:41:44,904 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:41:44,922 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:41:44,922 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:41:44,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:41:44 BoogieIcfgContainer [2024-11-08 20:41:44,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:41:44,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:41:44,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:41:44,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:41:44,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:41:43" (1/3) ... [2024-11-08 20:41:44,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38200316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:41:44, skipping insertion in model container [2024-11-08 20:41:44,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:43" (2/3) ... [2024-11-08 20:41:44,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38200316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:41:44, skipping insertion in model container [2024-11-08 20:41:44,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:41:44" (3/3) ... [2024-11-08 20:41:44,934 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2024-11-08 20:41:44,953 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:41:44,954 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:41:45,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:41:45,029 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;@470b9e00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:41:45,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:41:45,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 20:41:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 20:41:45,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:45,047 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:41:45,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:45,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:45,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1810492343, now seen corresponding path program 1 times [2024-11-08 20:41:45,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:41:45,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287964421] [2024-11-08 20:41:45,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:45,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:41:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:41:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:41:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:41:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:41:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:41:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:41:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:41:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:41:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:41:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:41:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:41:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:41:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:41:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:41:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:41:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:41:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:41:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:41:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:41:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:41:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:41:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:41:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:41:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:41:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:41:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:41:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:41:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:41:45,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:41:45,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287964421] [2024-11-08 20:41:45,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287964421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:45,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:45,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:41:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542795038] [2024-11-08 20:41:45,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:45,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:41:45,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:41:45,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:41:45,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:41:45,609 INFO L87 Difference]: Start difference. First operand has 86 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 20:41:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:45,645 INFO L93 Difference]: Finished difference Result 165 states and 289 transitions. [2024-11-08 20:41:45,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:41:45,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2024-11-08 20:41:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:45,659 INFO L225 Difference]: With dead ends: 165 [2024-11-08 20:41:45,660 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 20:41:45,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-08 20:41:45,669 INFO L432 NwaCegarLoop]: 125 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, 125 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-08 20:41:45,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:41:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 20:41:45,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 20:41:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 20:41:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-11-08 20:41:45,722 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 175 [2024-11-08 20:41:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:45,723 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-11-08 20:41:45,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 20:41:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-11-08 20:41:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 20:41:45,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:45,728 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:41:45,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:41:45,729 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:45,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1780209599, now seen corresponding path program 1 times [2024-11-08 20:41:45,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:41:45,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773743542] [2024-11-08 20:41:45,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:45,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:41:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:41:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:41:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:41:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:41:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:41:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:41:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:41:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:41:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:41:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:41:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:41:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:41:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:41:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:41:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:41:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:41:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:41:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:41:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:41:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:41:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:41:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:41:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:41:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:41:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:41:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:41:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:41:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:41:46,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:41:46,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773743542] [2024-11-08 20:41:46,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773743542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:46,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:46,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:41:46,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406364159] [2024-11-08 20:41:46,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:46,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:41:46,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:41:46,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:41:46,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:41:46,346 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:41:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:46,605 INFO L93 Difference]: Finished difference Result 225 states and 343 transitions. [2024-11-08 20:41:46,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:41:46,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-11-08 20:41:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:46,613 INFO L225 Difference]: With dead ends: 225 [2024-11-08 20:41:46,614 INFO L226 Difference]: Without dead ends: 146 [2024-11-08 20:41:46,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:41:46,616 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 96 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:46,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 309 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:41:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-08 20:41:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-11-08 20:41:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 94 states have internal predecessors, (124), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-08 20:41:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2024-11-08 20:41:46,656 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 175 [2024-11-08 20:41:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:46,657 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2024-11-08 20:41:46,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:41:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2024-11-08 20:41:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 20:41:46,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:46,664 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:41:46,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:41:46,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:46,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash 769092349, now seen corresponding path program 1 times [2024-11-08 20:41:46,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:41:46,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096171608] [2024-11-08 20:41:46,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:46,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:41:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:41:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:41:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:41:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:46,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:41:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:41:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:41:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:41:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:41:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:41:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:41:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:41:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:41:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:41:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:41:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:41:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:41:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:41:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:41:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:41:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:41:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:41:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:41:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:41:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:41:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:41:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:41:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:41:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:41:47,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:41:47,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096171608] [2024-11-08 20:41:47,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096171608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:47,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:47,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:41:47,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627406354] [2024-11-08 20:41:47,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:47,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:41:47,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:41:47,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:41:47,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:47,169 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:41:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:47,226 INFO L93 Difference]: Finished difference Result 422 states and 647 transitions. [2024-11-08 20:41:47,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:41:47,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-11-08 20:41:47,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:47,237 INFO L225 Difference]: With dead ends: 422 [2024-11-08 20:41:47,237 INFO L226 Difference]: Without dead ends: 282 [2024-11-08 20:41:47,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:47,242 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 71 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:47,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 273 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:41:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-08 20:41:47,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2024-11-08 20:41:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 183 states have internal predecessors, (241), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-08 20:41:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 429 transitions. [2024-11-08 20:41:47,332 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 429 transitions. Word has length 175 [2024-11-08 20:41:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:47,333 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 429 transitions. [2024-11-08 20:41:47,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:41:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 429 transitions. [2024-11-08 20:41:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 20:41:47,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:47,337 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:41:47,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:41:47,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:47,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1590851278, now seen corresponding path program 1 times [2024-11-08 20:41:47,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:41:47,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694970467] [2024-11-08 20:41:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:47,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:41:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:41:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:41:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:41:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:41:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:41:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:41:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:41:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:41:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:41:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:41:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:41:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:41:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:41:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:41:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:41:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:41:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:41:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:41:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:41:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:41:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:41:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:41:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:41:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:41:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:41:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:41:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:41:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:41:47,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:41:47,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694970467] [2024-11-08 20:41:47,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694970467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:47,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:47,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:41:47,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443561925] [2024-11-08 20:41:47,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:47,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:41:47,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:41:47,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:41:47,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:47,604 INFO L87 Difference]: Start difference. First operand 280 states and 429 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:41:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:47,669 INFO L93 Difference]: Finished difference Result 557 states and 855 transitions. [2024-11-08 20:41:47,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:41:47,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2024-11-08 20:41:47,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:47,674 INFO L225 Difference]: With dead ends: 557 [2024-11-08 20:41:47,674 INFO L226 Difference]: Without dead ends: 280 [2024-11-08 20:41:47,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:47,680 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:47,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:41:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-08 20:41:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2024-11-08 20:41:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 180 states have (on average 1.3111111111111111) internal successors, (236), 182 states have internal predecessors, (236), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-08 20:41:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 424 transitions. [2024-11-08 20:41:47,747 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 424 transitions. Word has length 176 [2024-11-08 20:41:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:47,749 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 424 transitions. [2024-11-08 20:41:47,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:41:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 424 transitions. [2024-11-08 20:41:47,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 20:41:47,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:47,753 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:41:47,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:41:47,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:47,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1692998768, now seen corresponding path program 1 times [2024-11-08 20:41:47,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:41:47,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338612540] [2024-11-08 20:41:47,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:47,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:41:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:41:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:41:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:41:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:41:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:41:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:41:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:41:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:41:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:41:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:41:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:41:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:41:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:41:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:41:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:41:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:41:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:41:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:41:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:41:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:41:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:41:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:41:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:41:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:41:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:41:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:41:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:41:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:41:48,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:41:48,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338612540] [2024-11-08 20:41:48,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338612540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:48,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:48,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:41:48,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476119487] [2024-11-08 20:41:48,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:48,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:41:48,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:41:48,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:41:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:41:48,125 INFO L87 Difference]: Start difference. First operand 279 states and 424 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:41:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:48,300 INFO L93 Difference]: Finished difference Result 687 states and 1040 transitions. [2024-11-08 20:41:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:41:48,302 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2024-11-08 20:41:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:48,307 INFO L225 Difference]: With dead ends: 687 [2024-11-08 20:41:48,309 INFO L226 Difference]: Without dead ends: 411 [2024-11-08 20:41:48,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:41:48,311 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 85 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:48,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 356 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:41:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-08 20:41:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 358. [2024-11-08 20:41:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 230 states have (on average 1.2695652173913043) internal successors, (292), 232 states have internal predecessors, (292), 121 states have call successors, (121), 6 states have call predecessors, (121), 6 states have return successors, (121), 119 states have call predecessors, (121), 121 states have call successors, (121) [2024-11-08 20:41:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 534 transitions. [2024-11-08 20:41:48,400 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 534 transitions. Word has length 176 [2024-11-08 20:41:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:48,401 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 534 transitions. [2024-11-08 20:41:48,401 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:41:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 534 transitions. [2024-11-08 20:41:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 20:41:48,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:48,403 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:41:48,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 20:41:48,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:48,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1751997195, now seen corresponding path program 1 times [2024-11-08 20:41:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:41:48,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755338829] [2024-11-08 20:41:48,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:41:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:41:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:41:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:41:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:41:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:41:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:41:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:41:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:41:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:41:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:41:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:41:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:41:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:41:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:41:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:41:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:41:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:41:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:41:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:41:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:41:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:41:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:41:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:41:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:41:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:41:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:41:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:41:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:41:48,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:41:48,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755338829] [2024-11-08 20:41:48,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755338829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:48,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:48,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:41:48,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704045421] [2024-11-08 20:41:48,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:48,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:41:48,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:41:48,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:41:48,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:48,702 INFO L87 Difference]: Start difference. First operand 358 states and 534 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:41:48,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:48,774 INFO L93 Difference]: Finished difference Result 909 states and 1348 transitions. [2024-11-08 20:41:48,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:41:48,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2024-11-08 20:41:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:48,780 INFO L225 Difference]: With dead ends: 909 [2024-11-08 20:41:48,780 INFO L226 Difference]: Without dead ends: 610 [2024-11-08 20:41:48,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:48,782 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 87 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:48,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 283 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:41:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-08 20:41:48,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2024-11-08 20:41:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 408 states have (on average 1.2818627450980393) internal successors, (523), 414 states have internal predecessors, (523), 185 states have call successors, (185), 10 states have call predecessors, (185), 10 states have return successors, (185), 179 states have call predecessors, (185), 185 states have call successors, (185) [2024-11-08 20:41:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 893 transitions. [2024-11-08 20:41:48,872 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 893 transitions. Word has length 177 [2024-11-08 20:41:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:48,873 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 893 transitions. [2024-11-08 20:41:48,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:41:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 893 transitions. [2024-11-08 20:41:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 20:41:48,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:48,875 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:41:48,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 20:41:48,876 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:48,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:48,876 INFO L85 PathProgramCache]: Analyzing trace with hash 854026359, now seen corresponding path program 1 times [2024-11-08 20:41:48,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:41:48,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305477780] [2024-11-08 20:41:48,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:48,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:41:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:41:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:41:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:41:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:41:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:41:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:41:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:41:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:41:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:41:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:41:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:41:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:41:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:41:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:41:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:41:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:41:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:41:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:41:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:41:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:41:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:41:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:41:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:41:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:41:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:41:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:41:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:41:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:41:49,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:41:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305477780] [2024-11-08 20:41:49,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305477780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:49,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:49,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:41:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257479038] [2024-11-08 20:41:49,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:49,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:41:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:41:49,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:41:49,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:41:49,244 INFO L87 Difference]: Start difference. First operand 604 states and 893 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:41:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:49,526 INFO L93 Difference]: Finished difference Result 1666 states and 2488 transitions. [2024-11-08 20:41:49,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:41:49,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2024-11-08 20:41:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:49,537 INFO L225 Difference]: With dead ends: 1666 [2024-11-08 20:41:49,537 INFO L226 Difference]: Without dead ends: 1168 [2024-11-08 20:41:49,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:41:49,541 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 110 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:49,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 344 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:41:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-11-08 20:41:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1100. [2024-11-08 20:41:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 738 states have (on average 1.2777777777777777) internal successors, (943), 750 states have internal predecessors, (943), 343 states have call successors, (343), 18 states have call predecessors, (343), 18 states have return successors, (343), 331 states have call predecessors, (343), 343 states have call successors, (343) [2024-11-08 20:41:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1629 transitions. [2024-11-08 20:41:49,676 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1629 transitions. Word has length 177 [2024-11-08 20:41:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:49,677 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1629 transitions. [2024-11-08 20:41:49,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:41:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1629 transitions. [2024-11-08 20:41:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 20:41:49,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:49,679 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:41:49,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 20:41:49,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:49,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2098796613, now seen corresponding path program 1 times [2024-11-08 20:41:49,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:41:49,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368677807] [2024-11-08 20:41:49,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:49,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:41:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:41:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:41:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:41:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:41:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:41:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:41:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:41:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:41:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:41:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:41:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:41:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:41:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:41:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:41:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:41:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:41:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:41:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:41:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:41:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:41:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:41:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:41:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:41:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:41:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:41:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:41:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:41:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 20:41:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:41:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368677807] [2024-11-08 20:41:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368677807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:41:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250760552] [2024-11-08 20:41:50,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:41:50,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:41:50,253 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-08 20:41:50,254 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-08 20:41:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 20:41:50,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:41:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 722 proven. 42 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-08 20:41:51,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:41:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 20:41:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250760552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:41:51,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 20:41:51,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2024-11-08 20:41:51,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073768411] [2024-11-08 20:41:51,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 20:41:51,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 20:41:51,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:41:51,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 20:41:51,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-08 20:41:51,674 INFO L87 Difference]: Start difference. First operand 1100 states and 1629 transitions. Second operand has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-11-08 20:41:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:53,211 INFO L93 Difference]: Finished difference Result 3558 states and 5142 transitions. [2024-11-08 20:41:53,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-08 20:41:53,216 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) Word has length 178 [2024-11-08 20:41:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:53,239 INFO L225 Difference]: With dead ends: 3558 [2024-11-08 20:41:53,239 INFO L226 Difference]: Without dead ends: 2564 [2024-11-08 20:41:53,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=366, Invalid=1440, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 20:41:53,244 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 520 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:53,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 905 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 20:41:53,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-11-08 20:41:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1240. [2024-11-08 20:41:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 861 states have (on average 1.2473867595818815) internal successors, (1074), 873 states have internal predecessors, (1074), 343 states have call successors, (343), 35 states have call predecessors, (343), 35 states have return successors, (343), 331 states have call predecessors, (343), 343 states have call successors, (343) [2024-11-08 20:41:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1760 transitions. [2024-11-08 20:41:53,451 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1760 transitions. Word has length 178 [2024-11-08 20:41:53,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:53,452 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1760 transitions. [2024-11-08 20:41:53,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-11-08 20:41:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1760 transitions. [2024-11-08 20:41:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 20:41:53,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:53,458 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:41:53,477 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-08 20:41:53,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:41:53,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:53,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:53,660 INFO L85 PathProgramCache]: Analyzing trace with hash 323789251, now seen corresponding path program 1 times [2024-11-08 20:41:53,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:41:53,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537257149] [2024-11-08 20:41:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:41:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:41:53,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969529207] [2024-11-08 20:41:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:53,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:41:53,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:41:53,862 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-08 20:41:53,864 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-08 20:41:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:54,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 20:41:54,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:41:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 338 proven. 300 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-08 20:41:56,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:42:14,739 WARN L286 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 20:42:33,340 WARN L286 SmtUtils]: Spent 7.14s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 20:42:47,547 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse4 (mod c_~var_1_19~0 4294967296)) (.cse2 (div (mod c_~var_1_6~0 65536) .cse7))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296)) (.cse5 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse6 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse1 (+ .cse4 1))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (or (< .cse5 .cse3) (< .cse3 .cse6) (< .cse4 .cse3)) (forall ((v_z_6 Int)) (or (not (= (mod (* v_z_6 .cse2) 4294967296) v_z_6)) (< .cse5 v_z_6) (< v_z_6 .cse6) (< v_z_6 .cse1))))))) is different from false [2024-11-08 20:43:12,827 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)