./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.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 feaa0156af8515c11e53760c56b6153bee93f0fe9288c23521b275fb865500c1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:51:49,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:51:49,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:51:49,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:51:49,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:51:49,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:51:49,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:51:49,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:51:49,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:51:49,852 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:51:49,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:51:49,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:51:49,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:51:49,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:51:49,854 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:51:49,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:51:49,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:51:49,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:51:49,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:51:49,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:51:49,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:51:49,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:51:49,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:51:49,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:51:49,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:51:49,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:51:49,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:51:49,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:51:49,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:51:49,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:51:49,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:51:49,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:51:49,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:51:49,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:51:49,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:51:49,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:51:49,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:51:49,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:51:49,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:51:49,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:51:49,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:51:49,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:51:49,861 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 -> feaa0156af8515c11e53760c56b6153bee93f0fe9288c23521b275fb865500c1 [2024-11-12 02:51:50,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:51:50,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:51:50,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:51:50,116 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:51:50,117 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:51:50,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i [2024-11-12 02:51:51,497 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:51:51,675 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:51:51,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i [2024-11-12 02:51:51,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32eda1fa/7a7c8a759417425b8b5652fc11198553/FLAG98d41a199 [2024-11-12 02:51:51,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32eda1fa/7a7c8a759417425b8b5652fc11198553 [2024-11-12 02:51:51,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:51:51,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:51:51,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:51:51,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:51:51,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:51:51,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:51:51" (1/1) ... [2024-11-12 02:51:51,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19713211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:51, skipping insertion in model container [2024-11-12 02:51:51,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:51:51" (1/1) ... [2024-11-12 02:51:51,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:51:51,901 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i[919,932] [2024-11-12 02:51:51,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:51:51,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:51:51,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i[919,932] [2024-11-12 02:51:52,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:51:52,037 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:51:52,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52 WrapperNode [2024-11-12 02:51:52,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:51:52,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:51:52,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:51:52,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:51:52,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (1/1) ... [2024-11-12 02:51:52,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (1/1) ... [2024-11-12 02:51:52,080 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-11-12 02:51:52,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:51:52,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:51:52,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:51:52,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:51:52,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (1/1) ... [2024-11-12 02:51:52,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (1/1) ... [2024-11-12 02:51:52,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (1/1) ... [2024-11-12 02:51:52,122 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 02:51:52,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (1/1) ... [2024-11-12 02:51:52,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (1/1) ... [2024-11-12 02:51:52,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (1/1) ... [2024-11-12 02:51:52,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (1/1) ... [2024-11-12 02:51:52,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (1/1) ... [2024-11-12 02:51:52,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (1/1) ... [2024-11-12 02:51:52,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:51:52,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:51:52,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:51:52,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:51:52,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (1/1) ... [2024-11-12 02:51:52,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:51:52,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:51:52,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 02:51:52,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 02:51:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:51:52,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:51:52,309 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:51:52,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:51:52,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:51:52,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:51:52,400 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:51:52,405 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:51:52,782 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 02:51:52,783 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:51:52,799 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:51:52,799 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:51:52,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:51:52 BoogieIcfgContainer [2024-11-12 02:51:52,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:51:52,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:51:52,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:51:52,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:51:52,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:51:51" (1/3) ... [2024-11-12 02:51:52,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1104c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:51:52, skipping insertion in model container [2024-11-12 02:51:52,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:52" (2/3) ... [2024-11-12 02:51:52,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1104c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:51:52, skipping insertion in model container [2024-11-12 02:51:52,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:51:52" (3/3) ... [2024-11-12 02:51:52,808 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i [2024-11-12 02:51:52,824 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:51:52,824 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:51:52,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:51:52,891 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;@7b79f91b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:51:52,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:51:52,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:51:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-12 02:51:52,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:52,908 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:52,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:52,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash 586108561, now seen corresponding path program 1 times [2024-11-12 02:51:52,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:51:52,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022645266] [2024-11-12 02:51:52,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:51:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:51:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:51:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:51:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:51:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:51:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:51:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:51:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:51:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:51:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:51:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:51:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:51:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:51:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:51:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:51:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:51:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:51:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:51:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:51:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:51:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:51:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:51:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:51:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 02:51:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:51:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 02:51:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 02:51:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:51:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:51:53,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:51:53,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022645266] [2024-11-12 02:51:53,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022645266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:51:53,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:51:53,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:51:53,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105634109] [2024-11-12 02:51:53,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:51:53,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:51:53,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:51:53,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:51:53,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:51:53,427 INFO L87 Difference]: Start difference. First operand has 90 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 02:51:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:51:53,461 INFO L93 Difference]: Finished difference Result 173 states and 302 transitions. [2024-11-12 02:51:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:51:53,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2024-11-12 02:51:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:51:53,472 INFO L225 Difference]: With dead ends: 173 [2024-11-12 02:51:53,473 INFO L226 Difference]: Without dead ends: 86 [2024-11-12 02:51:53,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:51:53,482 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:51:53,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:51:53,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-12 02:51:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-12 02:51:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:51:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-11-12 02:51:53,545 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 183 [2024-11-12 02:51:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:51:53,545 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-11-12 02:51:53,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 02:51:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-11-12 02:51:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-12 02:51:53,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:53,553 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:53,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:51:53,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:53,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash -574138027, now seen corresponding path program 1 times [2024-11-12 02:51:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:51:53,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950082081] [2024-11-12 02:51:53,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:53,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:51:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:51:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:51:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:51:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:51:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:51:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:51:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:51:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:51:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:51:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:51:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:51:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:51:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:51:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:51:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:51:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:51:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:51:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:51:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:51:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:51:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:51:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:51:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:51:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 02:51:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:51:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 02:51:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 02:51:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:51:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:51:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:51:54,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950082081] [2024-11-12 02:51:54,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950082081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:51:54,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:51:54,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:51:54,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685674669] [2024-11-12 02:51:54,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:51:54,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:51:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:51:54,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:51:54,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:51:54,167 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:51:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:51:54,464 INFO L93 Difference]: Finished difference Result 320 states and 495 transitions. [2024-11-12 02:51:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:51:54,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-12 02:51:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:51:54,469 INFO L225 Difference]: With dead ends: 320 [2024-11-12 02:51:54,469 INFO L226 Difference]: Without dead ends: 237 [2024-11-12 02:51:54,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 02:51:54,471 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 242 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:51:54,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 560 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:51:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-12 02:51:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 101. [2024-11-12 02:51:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 71 states have internal predecessors, (102), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:51:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2024-11-12 02:51:54,496 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 183 [2024-11-12 02:51:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:51:54,499 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2024-11-12 02:51:54,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:51:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2024-11-12 02:51:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-12 02:51:54,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:54,501 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:54,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 02:51:54,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:54,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:54,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1595206381, now seen corresponding path program 1 times [2024-11-12 02:51:54,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:51:54,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347722998] [2024-11-12 02:51:54,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:54,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:51:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:51:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:51:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:51:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:51:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:51:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:51:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:51:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:51:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:51:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:51:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:51:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:51:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:51:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:51:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:51:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:51:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:51:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:51:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:51:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:51:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:51:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:51:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:51:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 02:51:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:51:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 02:51:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 02:51:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:51:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:51:54,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:51:54,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347722998] [2024-11-12 02:51:54,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347722998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:51:54,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:51:54,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:51:54,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916992538] [2024-11-12 02:51:54,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:51:54,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:51:54,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:51:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:51:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:51:54,831 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:51:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:51:55,043 INFO L93 Difference]: Finished difference Result 335 states and 519 transitions. [2024-11-12 02:51:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:51:55,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-12 02:51:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:51:55,047 INFO L225 Difference]: With dead ends: 335 [2024-11-12 02:51:55,048 INFO L226 Difference]: Without dead ends: 237 [2024-11-12 02:51:55,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 02:51:55,049 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 221 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:51:55,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 622 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:51:55,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-12 02:51:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 101. [2024-11-12 02:51:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 71 states have internal predecessors, (102), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:51:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2024-11-12 02:51:55,063 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 183 [2024-11-12 02:51:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:51:55,064 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2024-11-12 02:51:55,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:51:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2024-11-12 02:51:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-12 02:51:55,067 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:55,067 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:55,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 02:51:55,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:55,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1273592405, now seen corresponding path program 1 times [2024-11-12 02:51:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:51:55,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750221285] [2024-11-12 02:51:55,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:55,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:51:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:51:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:51:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:51:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:51:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:51:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:51:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:51:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:51:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:51:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:51:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:51:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:51:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:51:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:51:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:51:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:51:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:51:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:51:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:51:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:51:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:51:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:51:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:51:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 02:51:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:51:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 02:51:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 02:51:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:51:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:51:57,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:51:57,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750221285] [2024-11-12 02:51:57,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750221285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:51:57,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:51:57,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:51:57,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877763492] [2024-11-12 02:51:57,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:51:57,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:51:57,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:51:57,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:51:57,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:51:57,326 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:51:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:51:57,581 INFO L93 Difference]: Finished difference Result 262 states and 407 transitions. [2024-11-12 02:51:57,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:51:57,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-12 02:51:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:51:57,585 INFO L225 Difference]: With dead ends: 262 [2024-11-12 02:51:57,585 INFO L226 Difference]: Without dead ends: 164 [2024-11-12 02:51:57,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:51:57,590 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 145 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:51:57,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 710 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:51:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-12 02:51:57,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 86. [2024-11-12 02:51:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:51:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2024-11-12 02:51:57,610 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 183 [2024-11-12 02:51:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:51:57,610 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2024-11-12 02:51:57,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:51:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2024-11-12 02:51:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-12 02:51:57,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:57,612 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:57,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 02:51:57,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:57,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:57,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1755683920, now seen corresponding path program 1 times [2024-11-12 02:51:57,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:51:57,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744341959] [2024-11-12 02:51:57,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:57,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:51:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat