./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.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 c06336cb14a71e49257e9a1a6eb7bbafa15ea27e03c080926f8f56f04c062783 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:31:59,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:31:59,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:31:59,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:31:59,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:31:59,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:31:59,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:31:59,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:31:59,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:31:59,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:31:59,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:31:59,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:31:59,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:31:59,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:31:59,508 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:31:59,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:31:59,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:31:59,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:31:59,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:31:59,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:31:59,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:31:59,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:31:59,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:31:59,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:31:59,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:31:59,514 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:31:59,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:31:59,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:31:59,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:31:59,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:31:59,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:31:59,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:31:59,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:31:59,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:31:59,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:31:59,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:31:59,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:31:59,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:31:59,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:31:59,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:31:59,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:31:59,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:31:59,519 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 -> c06336cb14a71e49257e9a1a6eb7bbafa15ea27e03c080926f8f56f04c062783 [2024-10-13 03:31:59,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:31:59,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:31:59,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:31:59,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:31:59,817 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:31:59,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i [2024-10-13 03:32:01,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:32:01,443 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:32:01,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i [2024-10-13 03:32:01,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5756d52/a2e70428c9364b0cae2c1607baedeff8/FLAGef492bc5f [2024-10-13 03:32:01,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5756d52/a2e70428c9364b0cae2c1607baedeff8 [2024-10-13 03:32:01,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:32:01,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:32:01,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:32:01,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:32:01,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:32:01,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:01,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70253889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01, skipping insertion in model container [2024-10-13 03:32:01,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:01,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:32:01,684 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i[917,930] [2024-10-13 03:32:01,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:32:01,808 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:32:01,819 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i[917,930] [2024-10-13 03:32:01,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:32:01,885 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:32:01,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01 WrapperNode [2024-10-13 03:32:01,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:32:01,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:32:01,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:32:01,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:32:01,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:01,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:01,949 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-10-13 03:32:01,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:32:01,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:32:01,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:32:01,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:32:01,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:01,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:01,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:01,984 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:32:01,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:01,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:01,988 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:01,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:01,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:01,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:02,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:32:02,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:32:02,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:32:02,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:32:02,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (1/1) ... [2024-10-13 03:32:02,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:32:02,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:32:02,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:32:02,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:32:02,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:32:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:32:02,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:32:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:32:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:32:02,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:32:02,184 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:32:02,186 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:32:02,453 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:32:02,454 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:32:02,495 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:32:02,495 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:32:02,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:32:02 BoogieIcfgContainer [2024-10-13 03:32:02,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:32:02,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:32:02,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:32:02,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:32:02,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:32:01" (1/3) ... [2024-10-13 03:32:02,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7e0527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:32:02, skipping insertion in model container [2024-10-13 03:32:02,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:32:01" (2/3) ... [2024-10-13 03:32:02,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7e0527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:32:02, skipping insertion in model container [2024-10-13 03:32:02,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:32:02" (3/3) ... [2024-10-13 03:32:02,505 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-90.i [2024-10-13 03:32:02,521 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:32:02,522 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:32:02,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:32:02,592 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;@18f46dbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:32:02,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:32:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:32:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 03:32:02,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:02,611 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:32:02,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:02,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1356584365, now seen corresponding path program 1 times [2024-10-13 03:32:02,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:02,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557168718] [2024-10-13 03:32:02,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:02,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:02,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:02,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:02,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:02,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:02,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:02,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:02,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:02,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:02,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:03,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:03,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:03,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:03,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:03,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:03,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:03,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:03,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:03,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:32:03,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:03,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557168718] [2024-10-13 03:32:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557168718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:03,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:03,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:32:03,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206635464] [2024-10-13 03:32:03,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:03,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:32:03,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:03,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:32:03,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:32:03,110 INFO L87 Difference]: Start difference. First operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 03:32:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:03,147 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2024-10-13 03:32:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:32:03,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 120 [2024-10-13 03:32:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:03,158 INFO L225 Difference]: With dead ends: 99 [2024-10-13 03:32:03,158 INFO L226 Difference]: Without dead ends: 49 [2024-10-13 03:32:03,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-10-13 03:32:03,168 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:03,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:32:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-13 03:32:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-13 03:32:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:32:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2024-10-13 03:32:03,213 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 120 [2024-10-13 03:32:03,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:03,214 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2024-10-13 03:32:03,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 03:32:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2024-10-13 03:32:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 03:32:03,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:03,219 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:32:03,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:32:03,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:03,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash -997376595, now seen corresponding path program 1 times [2024-10-13 03:32:03,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:03,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759003461] [2024-10-13 03:32:03,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:03,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:07,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:07,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:07,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:07,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:07,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:07,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:07,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:07,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:32:08,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:08,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759003461] [2024-10-13 03:32:08,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759003461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:08,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:08,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:32:08,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629140160] [2024-10-13 03:32:08,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:08,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:32:08,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:08,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:32:08,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:32:08,045 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:08,909 INFO L93 Difference]: Finished difference Result 96 states and 133 transitions. [2024-10-13 03:32:08,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:32:08,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2024-10-13 03:32:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:08,912 INFO L225 Difference]: With dead ends: 96 [2024-10-13 03:32:08,914 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 03:32:08,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:32:08,916 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 119 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:08,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 305 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 03:32:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 03:32:08,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2024-10-13 03:32:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 03:32:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2024-10-13 03:32:08,949 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 120 [2024-10-13 03:32:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:08,950 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2024-10-13 03:32:08,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2024-10-13 03:32:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 03:32:08,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:08,956 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:32:08,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:32:08,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:08,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:08,957 INFO L85 PathProgramCache]: Analyzing trace with hash -997317013, now seen corresponding path program 1 times [2024-10-13 03:32:08,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:08,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100276924] [2024-10-13 03:32:08,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:08,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:32:11,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100276924] [2024-10-13 03:32:11,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100276924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:11,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:11,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:32:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292141263] [2024-10-13 03:32:11,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:11,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:32:11,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:11,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:32:11,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:32:11,226 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 03:32:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:11,967 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2024-10-13 03:32:11,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:32:11,968 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 120 [2024-10-13 03:32:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:11,969 INFO L225 Difference]: With dead ends: 93 [2024-10-13 03:32:11,970 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 03:32:11,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:32:11,971 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 134 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:11,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 218 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:32:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 03:32:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2024-10-13 03:32:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 03:32:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2024-10-13 03:32:12,003 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 120 [2024-10-13 03:32:12,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:12,003 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2024-10-13 03:32:12,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 03:32:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2024-10-13 03:32:12,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 03:32:12,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:12,005 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:32:12,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:32:12,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:12,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1054634897, now seen corresponding path program 1 times [2024-10-13 03:32:12,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:12,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687886213] [2024-10-13 03:32:12,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:32:14,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:14,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687886213] [2024-10-13 03:32:14,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687886213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:14,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:14,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:32:14,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980125182] [2024-10-13 03:32:14,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:14,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:32:14,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:14,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:32:14,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:32:14,591 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:15,113 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2024-10-13 03:32:15,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:32:15,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2024-10-13 03:32:15,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:15,116 INFO L225 Difference]: With dead ends: 123 [2024-10-13 03:32:15,117 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 03:32:15,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:32:15,118 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 84 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:15,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 250 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:32:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 03:32:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2024-10-13 03:32:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 03:32:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2024-10-13 03:32:15,146 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 120 [2024-10-13 03:32:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:15,147 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2024-10-13 03:32:15,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2024-10-13 03:32:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 03:32:15,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:15,149 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:32:15,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:32:15,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:15,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:15,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1054575315, now seen corresponding path program 1 times [2024-10-13 03:32:15,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:15,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131968657] [2024-10-13 03:32:15,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:15,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:32:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:16,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131968657] [2024-10-13 03:32:16,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131968657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:16,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:16,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:32:16,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522852842] [2024-10-13 03:32:16,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:16,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:32:16,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:16,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:32:16,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:32:16,586 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:17,025 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2024-10-13 03:32:17,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:32:17,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2024-10-13 03:32:17,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:17,028 INFO L225 Difference]: With dead ends: 115 [2024-10-13 03:32:17,028 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 03:32:17,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:32:17,029 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 77 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:17,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 318 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:32:17,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 03:32:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2024-10-13 03:32:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 60 states have internal predecessors, (69), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 03:32:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2024-10-13 03:32:17,060 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 120 [2024-10-13 03:32:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:17,061 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2024-10-13 03:32:17,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2024-10-13 03:32:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 03:32:17,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:17,063 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:32:17,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:32:17,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:17,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:17,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1148591013, now seen corresponding path program 1 times [2024-10-13 03:32:17,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:17,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740147620] [2024-10-13 03:32:17,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:17,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:32:19,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740147620] [2024-10-13 03:32:19,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740147620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:19,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:19,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:32:19,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455848455] [2024-10-13 03:32:19,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:19,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:32:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:19,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:32:19,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:32:19,378 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:20,222 INFO L93 Difference]: Finished difference Result 154 states and 207 transitions. [2024-10-13 03:32:20,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 03:32:20,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-13 03:32:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:20,224 INFO L225 Difference]: With dead ends: 154 [2024-10-13 03:32:20,224 INFO L226 Difference]: Without dead ends: 152 [2024-10-13 03:32:20,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-10-13 03:32:20,227 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 150 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:20,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 300 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:32:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-13 03:32:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 65. [2024-10-13 03:32:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:32:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-10-13 03:32:20,250 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 121 [2024-10-13 03:32:20,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:20,251 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-10-13 03:32:20,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-10-13 03:32:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 03:32:20,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:20,255 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:32:20,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:32:20,255 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:20,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1148650595, now seen corresponding path program 1 times [2024-10-13 03:32:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672683698] [2024-10-13 03:32:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:32:21,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:21,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672683698] [2024-10-13 03:32:21,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672683698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:21,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:21,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:32:21,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198866290] [2024-10-13 03:32:21,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:21,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:32:21,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:21,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:32:21,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:32:21,606 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:22,421 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2024-10-13 03:32:22,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 03:32:22,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-13 03:32:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:22,424 INFO L225 Difference]: With dead ends: 135 [2024-10-13 03:32:22,426 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 03:32:22,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:32:22,427 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 133 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:22,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 326 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 03:32:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 03:32:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 65. [2024-10-13 03:32:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:32:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-10-13 03:32:22,447 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 121 [2024-10-13 03:32:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:22,448 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-10-13 03:32:22,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-10-13 03:32:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 03:32:22,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:22,450 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:32:22,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:32:22,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:22,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:22,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1091392293, now seen corresponding path program 1 times [2024-10-13 03:32:22,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:22,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531497494] [2024-10-13 03:32:22,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:22,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:32:23,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:23,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531497494] [2024-10-13 03:32:23,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531497494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:23,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:23,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:32:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698411902] [2024-10-13 03:32:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:23,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:32:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:23,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:32:23,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:32:23,549 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:24,289 INFO L93 Difference]: Finished difference Result 126 states and 171 transitions. [2024-10-13 03:32:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 03:32:24,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-13 03:32:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:24,291 INFO L225 Difference]: With dead ends: 126 [2024-10-13 03:32:24,291 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 03:32:24,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-10-13 03:32:24,293 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 119 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:24,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 363 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 03:32:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 03:32:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 64. [2024-10-13 03:32:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:32:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2024-10-13 03:32:24,318 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 121 [2024-10-13 03:32:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:24,318 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2024-10-13 03:32:24,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2024-10-13 03:32:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 03:32:24,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:24,320 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:32:24,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:32:24,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:24,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:24,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1371368921, now seen corresponding path program 1 times [2024-10-13 03:32:24,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:24,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080587435] [2024-10-13 03:32:24,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:24,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:32:26,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:26,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080587435] [2024-10-13 03:32:26,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080587435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:26,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:26,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:32:26,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988779275] [2024-10-13 03:32:26,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:26,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:32:26,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:26,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:32:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:32:26,259 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:26,626 INFO L93 Difference]: Finished difference Result 91 states and 126 transitions. [2024-10-13 03:32:26,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:32:26,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-13 03:32:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:26,628 INFO L225 Difference]: With dead ends: 91 [2024-10-13 03:32:26,628 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 03:32:26,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:32:26,631 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 72 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:26,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 259 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:32:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 03:32:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2024-10-13 03:32:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:32:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2024-10-13 03:32:26,649 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 121 [2024-10-13 03:32:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:26,650 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2024-10-13 03:32:26,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2024-10-13 03:32:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 03:32:26,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:26,651 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:32:26,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 03:32:26,652 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:26,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:26,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1428567641, now seen corresponding path program 1 times [2024-10-13 03:32:26,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:26,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807596305] [2024-10-13 03:32:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:32:28,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:28,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807596305] [2024-10-13 03:32:28,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807596305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:28,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:28,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:32:28,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358247685] [2024-10-13 03:32:28,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:28,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:32:28,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:28,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:32:28,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:32:28,104 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:28,437 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2024-10-13 03:32:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:32:28,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-13 03:32:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:28,438 INFO L225 Difference]: With dead ends: 89 [2024-10-13 03:32:28,438 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 03:32:28,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:32:28,439 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 78 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:28,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 242 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:32:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 03:32:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 03:32:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 03:32:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 03:32:28,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2024-10-13 03:32:28,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:28,441 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 03:32:28,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:32:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 03:32:28,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 03:32:28,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:32:28,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 03:32:28,447 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:32:28,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.