./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32753d18822513354e4b9efa6f4c19579a930a0a9d80feee2c0fa6780fee33a5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:28:24,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:28:24,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:28:24,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:28:24,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:28:24,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:28:24,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:28:24,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:28:24,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:28:24,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:28:24,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:28:24,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:28:24,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:28:24,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:28:24,322 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:28:24,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:28:24,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:28:24,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:28:24,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:28:24,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:28:24,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:28:24,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:28:24,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:28:24,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:28:24,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:28:24,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:28:24,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:28:24,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:28:24,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:28:24,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:28:24,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:28:24,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:28:24,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:28:24,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:28:24,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:28:24,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:28:24,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:28:24,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:28:24,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:28:24,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:28:24,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:28:24,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:28:24,332 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 -> 32753d18822513354e4b9efa6f4c19579a930a0a9d80feee2c0fa6780fee33a5 [2024-11-08 22:28:24,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:28:24,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:28:24,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:28:24,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:28:24,591 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:28:24,592 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-ps-cn_file-59.i [2024-11-08 22:28:25,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:28:26,175 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:28:26,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-59.i [2024-11-08 22:28:26,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9e91ac09/dc9334acf8bb4ad380c68d0bb66d0b09/FLAG9a475a36d [2024-11-08 22:28:26,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9e91ac09/dc9334acf8bb4ad380c68d0bb66d0b09 [2024-11-08 22:28:26,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:28:26,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:28:26,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:28:26,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:28:26,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:28:26,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d8f523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26, skipping insertion in model container [2024-11-08 22:28:26,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:28:26,453 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-ps-cn_file-59.i[919,932] [2024-11-08 22:28:26,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:28:26,610 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:28:26,621 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-ps-cn_file-59.i[919,932] [2024-11-08 22:28:26,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:28:26,688 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:28:26,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26 WrapperNode [2024-11-08 22:28:26,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:28:26,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:28:26,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:28:26,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:28:26,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,750 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2024-11-08 22:28:26,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:28:26,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:28:26,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:28:26,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:28:26,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,795 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:28:26,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:28:26,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:28:26,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:28:26,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:28:26,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (1/1) ... [2024-11-08 22:28:26,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:28:26,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:28:26,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:28:26,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:28:26,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:28:26,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:28:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:28:26,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:28:26,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:28:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:28:27,037 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:28:27,039 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:28:27,479 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 22:28:27,479 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:28:27,497 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:28:27,497 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:28:27,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:27 BoogieIcfgContainer [2024-11-08 22:28:27,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:28:27,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:28:27,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:28:27,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:28:27,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:28:26" (1/3) ... [2024-11-08 22:28:27,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6e0968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:28:27, skipping insertion in model container [2024-11-08 22:28:27,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:26" (2/3) ... [2024-11-08 22:28:27,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6e0968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:28:27, skipping insertion in model container [2024-11-08 22:28:27,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:27" (3/3) ... [2024-11-08 22:28:27,512 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-59.i [2024-11-08 22:28:27,531 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:28:27,531 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:28:27,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:28:27,613 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;@7971ef15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:28:27,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:28:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 22:28:27,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 22:28:27,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:28:27,638 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:28:27,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:28:27,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:28:27,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1016225513, now seen corresponding path program 1 times [2024-11-08 22:28:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:28:27,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840456827] [2024-11-08 22:28:27,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:28:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:28:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:28:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 22:28:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:28:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 22:28:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:28:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:28:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:28:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:28:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:28:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:28:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:28:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:28:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:28:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:28:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:28:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:28:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:28:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:28:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:28:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:28:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:28:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:28:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:28:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:28:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:28:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:28:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:28:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:28:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:28:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:28:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:28:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 22:28:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:28:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 22:28:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:28:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840456827] [2024-11-08 22:28:28,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840456827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:28:28,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:28:28,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:28:28,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354162405] [2024-11-08 22:28:28,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:28:28,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:28:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:28:28,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:28:28,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:28:28,312 INFO L87 Difference]: Start difference. First operand has 104 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 22:28:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:28:28,350 INFO L93 Difference]: Finished difference Result 201 states and 360 transitions. [2024-11-08 22:28:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:28:28,353 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215 [2024-11-08 22:28:28,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:28:28,363 INFO L225 Difference]: With dead ends: 201 [2024-11-08 22:28:28,364 INFO L226 Difference]: Without dead ends: 100 [2024-11-08 22:28:28,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:28:28,370 INFO L432 NwaCegarLoop]: 158 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, 158 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:28:28,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:28:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-08 22:28:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-08 22:28:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 22:28:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2024-11-08 22:28:28,416 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 215 [2024-11-08 22:28:28,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:28:28,416 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2024-11-08 22:28:28,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 22:28:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2024-11-08 22:28:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 22:28:28,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:28:28,421 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:28:28,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:28:28,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:28:28,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:28:28,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1689287729, now seen corresponding path program 1 times [2024-11-08 22:28:28,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:28:28,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209138741] [2024-11-08 22:28:28,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:28:28,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:28:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:28:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 22:28:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:28:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 22:28:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:28:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:28:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:28:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:28:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:28:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:28:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:28:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:28:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:28:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:28:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:28:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:28:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:28:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:28:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:28:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:28:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:28:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:28:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:28:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:28:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:28:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:28:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:28:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:28:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:28:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:28:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:28:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 22:28:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:28:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 22:28:29,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:28:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209138741] [2024-11-08 22:28:29,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209138741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:28:29,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:28:29,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:28:29,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799847359] [2024-11-08 22:28:29,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:28:29,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:28:29,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:28:29,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:28:29,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:28:29,114 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 22:28:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:28:29,232 INFO L93 Difference]: Finished difference Result 294 states and 468 transitions. [2024-11-08 22:28:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:28:29,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-11-08 22:28:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:28:29,237 INFO L225 Difference]: With dead ends: 294 [2024-11-08 22:28:29,237 INFO L226 Difference]: Without dead ends: 197 [2024-11-08 22:28:29,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:28:29,240 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 94 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:28:29,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 468 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:28:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-08 22:28:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-11-08 22:28:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 124 states have (on average 1.403225806451613) internal successors, (174), 124 states have internal predecessors, (174), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 22:28:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 310 transitions. [2024-11-08 22:28:29,297 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 310 transitions. Word has length 215 [2024-11-08 22:28:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:28:29,298 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 310 transitions. [2024-11-08 22:28:29,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 22:28:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 310 transitions. [2024-11-08 22:28:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 22:28:29,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:28:29,305 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:28:29,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:28:29,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:28:29,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:28:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash -871639279, now seen corresponding path program 1 times [2024-11-08 22:28:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:28:29,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748357471] [2024-11-08 22:28:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:28:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:28:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:28:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 22:28:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:28:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 22:28:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:28:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:28:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:28:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:28:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:28:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:28:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:28:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:28:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:28:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:28:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:28:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:28:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:28:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:28:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:28:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:28:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:28:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:28:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:28:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:28:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:28:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:28:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:28:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:28:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:28:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:28:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:28:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 22:28:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:28:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 22:28:29,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:28:29,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748357471] [2024-11-08 22:28:29,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748357471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:28:29,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:28:29,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:28:29,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243585063] [2024-11-08 22:28:29,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:28:29,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:28:29,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:28:29,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:28:29,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:28:29,819 INFO L87 Difference]: Start difference. First operand 195 states and 310 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 22:28:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:28:30,070 INFO L93 Difference]: Finished difference Result 520 states and 830 transitions. [2024-11-08 22:28:30,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:28:30,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-11-08 22:28:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:28:30,075 INFO L225 Difference]: With dead ends: 520 [2024-11-08 22:28:30,076 INFO L226 Difference]: Without dead ends: 328 [2024-11-08 22:28:30,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:28:30,078 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 121 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:28:30,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 458 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:28:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-08 22:28:30,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 292. [2024-11-08 22:28:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 186 states have (on average 1.4086021505376345) internal successors, (262), 186 states have internal predecessors, (262), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-08 22:28:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 466 transitions. [2024-11-08 22:28:30,136 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 466 transitions. Word has length 215 [2024-11-08 22:28:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:28:30,137 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 466 transitions. [2024-11-08 22:28:30,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-08 22:28:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 466 transitions. [2024-11-08 22:28:30,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 22:28:30,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:28:30,141 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:28:30,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:28:30,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:28:30,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:28:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash 348602023, now seen corresponding path program 1 times [2024-11-08 22:28:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:28:30,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422138344] [2024-11-08 22:28:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:28:30,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:28:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:28:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 22:28:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:28:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 22:28:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:28:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:28:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:28:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:28:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:28:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:28:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:28:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:28:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:28:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:28:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:28:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:28:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:28:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:28:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:28:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:28:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:28:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:28:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:28:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:28:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:28:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 22:28:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:28:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 22:28:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:28:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 22:28:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 22:28:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 22:28:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 22:28:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 22:28:30,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:28:30,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422138344] [2024-11-08 22:28:30,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422138344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:28:30,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:28:30,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 22:28:30,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629720826] [2024-11-08 22:28:30,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:28:30,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 22:28:30,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:28:30,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 22:28:30,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:28:30,859 INFO L87 Difference]: Start difference. First operand 292 states and 466 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 22:28:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:28:31,472 INFO L93 Difference]: Finished difference Result 694 states and 1103 transitions. [2024-11-08 22:28:31,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:28:31,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 216 [2024-11-08 22:28:31,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:28:31,478 INFO L225 Difference]: With dead ends: 694 [2024-11-08 22:28:31,478 INFO L226 Difference]: Without dead ends: 502 [2024-11-08 22:28:31,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 22:28:31,480 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 310 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:28:31,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 674 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:28:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-08 22:28:31,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 482. [2024-11-08 22:28:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 306 states have (on average 1.3986928104575163) internal successors, (428), 306 states have internal predecessors, (428), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-08 22:28:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 768 transitions. [2024-11-08 22:28:31,535 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 768 transitions. Word has length 216 [2024-11-08 22:28:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:28:31,536 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 768 transitions. [2024-11-08 22:28:31,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 22:28:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 768 transitions. [2024-11-08 22:28:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 22:28:31,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:28:31,539 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:28:31,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:28:31,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:28:31,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:28:31,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1835504070, now seen corresponding path program 1 times [2024-11-08 22:28:31,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:28:31,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302737200] [2024-11-08 22:28:31,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:28:31,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:28:31,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579066149] [2024-11-08 22:28:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:28:31,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:28:31,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:28:31,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:28:31,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 22:28:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:31,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 22:28:31,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:28:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 429 proven. 405 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-11-08 22:28:35,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:28:43,810 WARN L286 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:29:32,310 WARN L286 SmtUtils]: Spent 25.91s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:29:45,020 WARN L286 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)