./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-42.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 bcbcb400fb3c2001bae06c1a3f5fabc11943b7dd9f57ad2b480b7bdc063ccccb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 19:10:35,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 19:10:35,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 19:10:35,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 19:10:35,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 19:10:35,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 19:10:35,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 19:10:35,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 19:10:35,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 19:10:35,760 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 19:10:35,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 19:10:35,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 19:10:35,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 19:10:35,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 19:10:35,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 19:10:35,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 19:10:35,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 19:10:35,766 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 19:10:35,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 19:10:35,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 19:10:35,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 19:10:35,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 19:10:35,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 19:10:35,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 19:10:35,768 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 19:10:35,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 19:10:35,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 19:10:35,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 19:10:35,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 19:10:35,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 19:10:35,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 19:10:35,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 19:10:35,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 19:10:35,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 19:10:35,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 19:10:35,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 19:10:35,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 19:10:35,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 19:10:35,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 19:10:35,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 19:10:35,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 19:10:35,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 19:10:35,772 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 -> bcbcb400fb3c2001bae06c1a3f5fabc11943b7dd9f57ad2b480b7bdc063ccccb [2024-11-18 19:10:35,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 19:10:35,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 19:10:35,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 19:10:35,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 19:10:35,989 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 19:10:35,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-42.i [2024-11-18 19:10:37,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 19:10:37,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 19:10:37,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-42.i [2024-11-18 19:10:37,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6f4fdaf/fa7e22f444bb4f0e88e30bcbc091b17d/FLAG34f2f4f30 [2024-11-18 19:10:37,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6f4fdaf/fa7e22f444bb4f0e88e30bcbc091b17d [2024-11-18 19:10:37,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 19:10:37,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 19:10:37,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 19:10:37,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 19:10:37,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 19:10:37,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:10:37" (1/1) ... [2024-11-18 19:10:37,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528c802b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:37, skipping insertion in model container [2024-11-18 19:10:37,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:10:37" (1/1) ... [2024-11-18 19:10:37,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 19:10:37,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-42.i[916,929] [2024-11-18 19:10:37,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 19:10:37,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 19:10:38,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-42.i[916,929] [2024-11-18 19:10:38,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 19:10:38,047 INFO L204 MainTranslator]: Completed translation [2024-11-18 19:10:38,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38 WrapperNode [2024-11-18 19:10:38,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 19:10:38,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 19:10:38,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 19:10:38,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 19:10:38,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (1/1) ... [2024-11-18 19:10:38,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (1/1) ... [2024-11-18 19:10:38,111 INFO L138 Inliner]: procedures = 26, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 341 [2024-11-18 19:10:38,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 19:10:38,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 19:10:38,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 19:10:38,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 19:10:38,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (1/1) ... [2024-11-18 19:10:38,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (1/1) ... [2024-11-18 19:10:38,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (1/1) ... [2024-11-18 19:10:38,149 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-18 19:10:38,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (1/1) ... [2024-11-18 19:10:38,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (1/1) ... [2024-11-18 19:10:38,164 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (1/1) ... [2024-11-18 19:10:38,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (1/1) ... [2024-11-18 19:10:38,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (1/1) ... [2024-11-18 19:10:38,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (1/1) ... [2024-11-18 19:10:38,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 19:10:38,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 19:10:38,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 19:10:38,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 19:10:38,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (1/1) ... [2024-11-18 19:10:38,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 19:10:38,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 19:10:38,240 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-18 19:10:38,243 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-18 19:10:38,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 19:10:38,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 19:10:38,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 19:10:38,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 19:10:38,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 19:10:38,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 19:10:38,387 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 19:10:38,389 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 19:10:38,938 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-18 19:10:38,938 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 19:10:38,956 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 19:10:38,957 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 19:10:38,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:10:38 BoogieIcfgContainer [2024-11-18 19:10:38,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 19:10:38,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 19:10:38,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 19:10:38,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 19:10:38,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:10:37" (1/3) ... [2024-11-18 19:10:38,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc5b01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:10:38, skipping insertion in model container [2024-11-18 19:10:38,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:38" (2/3) ... [2024-11-18 19:10:38,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc5b01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:10:38, skipping insertion in model container [2024-11-18 19:10:38,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:10:38" (3/3) ... [2024-11-18 19:10:38,972 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-42.i [2024-11-18 19:10:38,987 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 19:10:38,987 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 19:10:39,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 19:10:39,055 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;@7d7b969f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 19:10:39,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 19:10:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 90 states have internal predecessors, (128), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-18 19:10:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-11-18 19:10:39,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:10:39,083 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:10:39,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:10:39,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:10:39,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1657357438, now seen corresponding path program 1 times [2024-11-18 19:10:39,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:10:39,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429372782] [2024-11-18 19:10:39,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:10:39,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:10:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:10:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-18 19:10:40,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:10:40,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429372782] [2024-11-18 19:10:40,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429372782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:10:40,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:10:40,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 19:10:40,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371281422] [2024-11-18 19:10:40,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:10:40,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 19:10:40,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:10:40,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 19:10:40,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 19:10:40,200 INFO L87 Difference]: Start difference. First operand has 149 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 90 states have internal predecessors, (128), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-18 19:10:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:10:40,600 INFO L93 Difference]: Finished difference Result 434 states and 831 transitions. [2024-11-18 19:10:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 19:10:40,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 353 [2024-11-18 19:10:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:10:40,612 INFO L225 Difference]: With dead ends: 434 [2024-11-18 19:10:40,613 INFO L226 Difference]: Without dead ends: 288 [2024-11-18 19:10:40,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 19:10:40,620 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 177 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 19:10:40,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 687 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 19:10:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-18 19:10:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 267. [2024-11-18 19:10:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 150 states have (on average 1.3866666666666667) internal successors, (208), 150 states have internal predecessors, (208), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-18 19:10:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 436 transitions. [2024-11-18 19:10:40,700 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 436 transitions. Word has length 353 [2024-11-18 19:10:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:10:40,702 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 436 transitions. [2024-11-18 19:10:40,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-18 19:10:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 436 transitions. [2024-11-18 19:10:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-18 19:10:40,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:10:40,708 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:10:40,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 19:10:40,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:10:40,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:10:40,710 INFO L85 PathProgramCache]: Analyzing trace with hash -64710391, now seen corresponding path program 1 times [2024-11-18 19:10:40,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:10:40,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662886859] [2024-11-18 19:10:40,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:10:40,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:10:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:10:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-18 19:10:41,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:10:41,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662886859] [2024-11-18 19:10:41,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662886859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:10:41,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:10:41,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 19:10:41,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323515364] [2024-11-18 19:10:41,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:10:41,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 19:10:41,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:10:41,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 19:10:41,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 19:10:41,288 INFO L87 Difference]: Start difference. First operand 267 states and 436 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-18 19:10:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:10:41,719 INFO L93 Difference]: Finished difference Result 595 states and 967 transitions. [2024-11-18 19:10:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 19:10:41,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 354 [2024-11-18 19:10:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:10:41,728 INFO L225 Difference]: With dead ends: 595 [2024-11-18 19:10:41,728 INFO L226 Difference]: Without dead ends: 453 [2024-11-18 19:10:41,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-18 19:10:41,730 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 207 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 19:10:41,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 859 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 19:10:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-18 19:10:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 407. [2024-11-18 19:10:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 232 states have (on average 1.396551724137931) internal successors, (324), 232 states have internal predecessors, (324), 171 states have call successors, (171), 3 states have call predecessors, (171), 3 states have return successors, (171), 171 states have call predecessors, (171), 171 states have call successors, (171) [2024-11-18 19:10:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 666 transitions. [2024-11-18 19:10:41,791 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 666 transitions. Word has length 354 [2024-11-18 19:10:41,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:10:41,792 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 666 transitions. [2024-11-18 19:10:41,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-18 19:10:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 666 transitions. [2024-11-18 19:10:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-18 19:10:41,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:10:41,800 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:10:41,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 19:10:41,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:10:41,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:10:41,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1344574069, now seen corresponding path program 1 times [2024-11-18 19:10:41,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:10:41,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902210345] [2024-11-18 19:10:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:10:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:10:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:10:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-18 19:10:42,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:10:42,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902210345] [2024-11-18 19:10:42,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902210345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:10:42,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:10:42,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 19:10:42,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732647408] [2024-11-18 19:10:42,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:10:42,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 19:10:42,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:10:42,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 19:10:42,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 19:10:42,224 INFO L87 Difference]: Start difference. First operand 407 states and 666 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-18 19:10:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:10:42,296 INFO L93 Difference]: Finished difference Result 689 states and 1128 transitions. [2024-11-18 19:10:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 19:10:42,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 354 [2024-11-18 19:10:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:10:42,311 INFO L225 Difference]: With dead ends: 689 [2024-11-18 19:10:42,312 INFO L226 Difference]: Without dead ends: 407 [2024-11-18 19:10:42,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 19:10:42,317 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 19:10:42,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 19:10:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-18 19:10:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2024-11-18 19:10:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 232 states have (on average 1.3879310344827587) internal successors, (322), 232 states have internal predecessors, (322), 171 states have call successors, (171), 3 states have call predecessors, (171), 3 states have return successors, (171), 171 states have call predecessors, (171), 171 states have call successors, (171) [2024-11-18 19:10:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 664 transitions. [2024-11-18 19:10:42,387 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 664 transitions. Word has length 354 [2024-11-18 19:10:42,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:10:42,391 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 664 transitions. [2024-11-18 19:10:42,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-18 19:10:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 664 transitions. [2024-11-18 19:10:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-18 19:10:42,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:10:42,396 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:10:42,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 19:10:42,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:10:42,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:10:42,397 INFO L85 PathProgramCache]: Analyzing trace with hash -664515699, now seen corresponding path program 1 times [2024-11-18 19:10:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:10:42,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57871947] [2024-11-18 19:10:42,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:10:42,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:10:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:10:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 117 proven. 51 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2024-11-18 19:10:42,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:10:42,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57871947] [2024-11-18 19:10:42,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57871947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 19:10:42,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93546983] [2024-11-18 19:10:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:10:42,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 19:10:42,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 19:10:42,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 19:10:42,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 19:10:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:10:43,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 19:10:43,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 19:10:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 2786 proven. 51 refuted. 0 times theorem prover too weak. 3547 trivial. 0 not checked. [2024-11-18 19:10:43,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 19:10:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 117 proven. 51 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2024-11-18 19:10:43,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93546983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 19:10:43,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 19:10:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-18 19:10:43,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463114522] [2024-11-18 19:10:43,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 19:10:43,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 19:10:43,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:10:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 19:10:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-18 19:10:43,807 INFO L87 Difference]: Start difference. First operand 407 states and 664 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (91), 2 states have call predecessors, (91), 4 states have return successors, (93), 4 states have call predecessors, (93), 4 states have call successors, (93) [2024-11-18 19:10:44,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:10:44,219 INFO L93 Difference]: Finished difference Result 728 states and 1176 transitions. [2024-11-18 19:10:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 19:10:44,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (91), 2 states have call predecessors, (91), 4 states have return successors, (93), 4 states have call predecessors, (93), 4 states have call successors, (93) Word has length 354 [2024-11-18 19:10:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:10:44,224 INFO L225 Difference]: With dead ends: 728 [2024-11-18 19:10:44,225 INFO L226 Difference]: Without dead ends: 425 [2024-11-18 19:10:44,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2024-11-18 19:10:44,227 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 337 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 19:10:44,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 398 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 19:10:44,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-18 19:10:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 419. [2024-11-18 19:10:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 241 states have (on average 1.3609958506224067) internal successors, (328), 241 states have internal predecessors, (328), 171 states have call successors, (171), 6 states have call predecessors, (171), 6 states have return successors, (171), 171 states have call predecessors, (171), 171 states have call successors, (171) [2024-11-18 19:10:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 670 transitions. [2024-11-18 19:10:44,283 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 670 transitions. Word has length 354 [2024-11-18 19:10:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:10:44,284 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 670 transitions. [2024-11-18 19:10:44,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (91), 2 states have call predecessors, (91), 4 states have return successors, (93), 4 states have call predecessors, (93), 4 states have call successors, (93) [2024-11-18 19:10:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 670 transitions. [2024-11-18 19:10:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-18 19:10:44,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:10:44,289 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:10:44,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 19:10:44,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 19:10:44,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:10:44,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:10:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash -155042609, now seen corresponding path program 1 times [2024-11-18 19:10:44,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:10:44,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521541227] [2024-11-18 19:10:44,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:10:44,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:10:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:10:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 51 proven. 279 refuted. 0 times theorem prover too weak. 6054 trivial. 0 not checked. [2024-11-18 19:10:45,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:10:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521541227] [2024-11-18 19:10:45,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521541227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 19:10:45,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092399114] [2024-11-18 19:10:45,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:10:45,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 19:10:45,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 19:10:45,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 19:10:45,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 19:10:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:10:45,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-18 19:10:45,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 19:10:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 2039 proven. 279 refuted. 0 times theorem prover too weak. 4066 trivial. 0 not checked. [2024-11-18 19:10:47,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 19:10:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 51 proven. 282 refuted. 0 times theorem prover too weak. 6051 trivial. 0 not checked. [2024-11-18 19:10:48,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092399114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 19:10:48,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 19:10:48,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 20 [2024-11-18 19:10:48,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57385224] [2024-11-18 19:10:48,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 19:10:48,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-18 19:10:48,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:10:48,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-18 19:10:48,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-11-18 19:10:48,492 INFO L87 Difference]: Start difference. First operand 419 states and 670 transitions. Second operand has 20 states, 20 states have (on average 6.8) internal successors, (136), 20 states have internal predecessors, (136), 3 states have call successors, (106), 3 states have call predecessors, (106), 7 states have return successors, (108), 3 states have call predecessors, (108), 3 states have call successors, (108) [2024-11-18 19:10:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:10:51,376 INFO L93 Difference]: Finished difference Result 2027 states and 3160 transitions. [2024-11-18 19:10:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-11-18 19:10:51,377 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.8) internal successors, (136), 20 states have internal predecessors, (136), 3 states have call successors, (106), 3 states have call predecessors, (106), 7 states have return successors, (108), 3 states have call predecessors, (108), 3 states have call successors, (108) Word has length 354 [2024-11-18 19:10:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:10:51,386 INFO L225 Difference]: With dead ends: 2027 [2024-11-18 19:10:51,386 INFO L226 Difference]: Without dead ends: 1725 [2024-11-18 19:10:51,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 705 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2685 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1452, Invalid=6380, Unknown=0, NotChecked=0, Total=7832 [2024-11-18 19:10:51,390 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 2008 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2079 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-18 19:10:51,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2079 Valid, 2237 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 2177 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-18 19:10:51,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2024-11-18 19:10:51,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 861. [2024-11-18 19:10:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 595 states have (on average 1.4436974789915966) internal successors, (859), 598 states have internal predecessors, (859), 246 states have call successors, (246), 19 states have call predecessors, (246), 19 states have return successors, (246), 243 states have call predecessors, (246), 246 states have call successors, (246) [2024-11-18 19:10:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1351 transitions. [2024-11-18 19:10:51,511 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1351 transitions. Word has length 354 [2024-11-18 19:10:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:10:51,512 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1351 transitions. [2024-11-18 19:10:51,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.8) internal successors, (136), 20 states have internal predecessors, (136), 3 states have call successors, (106), 3 states have call predecessors, (106), 7 states have return successors, (108), 3 states have call predecessors, (108), 3 states have call successors, (108) [2024-11-18 19:10:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1351 transitions. [2024-11-18 19:10:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-18 19:10:51,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:10:51,518 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:10:51,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 19:10:51,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 19:10:51,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:10:51,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:10:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1166159859, now seen corresponding path program 1 times [2024-11-18 19:10:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:10:51,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021941451] [2024-11-18 19:10:51,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:10:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:10:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:10:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 318 proven. 168 refuted. 0 times theorem prover too weak. 5898 trivial. 0 not checked. [2024-11-18 19:10:53,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:10:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021941451] [2024-11-18 19:10:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021941451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 19:10:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402808416] [2024-11-18 19:10:53,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:10:53,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 19:10:53,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 19:10:53,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 19:10:53,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 19:10:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:10:53,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-18 19:10:53,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 19:10:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 3377 proven. 297 refuted. 0 times theorem prover too weak. 2710 trivial. 0 not checked. [2024-11-18 19:10:54,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 19:10:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 318 proven. 177 refuted. 0 times theorem prover too weak. 5889 trivial. 0 not checked. [2024-11-18 19:10:55,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402808416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 19:10:55,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 19:10:55,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 26 [2024-11-18 19:10:55,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642881592] [2024-11-18 19:10:55,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 19:10:55,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-18 19:10:55,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:10:55,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-18 19:10:55,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2024-11-18 19:10:55,358 INFO L87 Difference]: Start difference. First operand 861 states and 1351 transitions. Second operand has 26 states, 24 states have (on average 6.166666666666667) internal successors, (148), 23 states have internal predecessors, (148), 9 states have call successors, (101), 4 states have call predecessors, (101), 9 states have return successors, (104), 9 states have call predecessors, (104), 9 states have call successors, (104) [2024-11-18 19:11:08,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 19:11:12,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 19:11:16,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 19:11:22,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 19:11:27,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 19:11:31,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 19:11:35,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 19:11:38,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 19:11:43,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 19:11:45,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 19:11:53,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 19:12:08,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []